Melola Discovery

← Melola Discovery

Jurnal SINTA 1

The dominant edge metric dimension of graphs

Electronic Journal of Graph Theory and Applications · Vol. 11 No. 1 (2023) · hlm. 197–208

DOI
10.5614/ejgta.2023.11.1.16
ISSN
2338-2287
Terbit
2023-04-08
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

For an ordered subset S = {v1, …, vk} of vertices in a connected graph G and an edge e′ of G, the edge metric S-representation of e′=ab is the vector rGe(e′|S)=(dG(e′,v1),…,dG(e′,vk)), where dG(e′,vi)=min{dG(a, vi),dG(b, vi)}. A dominant edge metric generator for G is a vertex cover S of G such that the edges of G have pairwise different edge metric S-representations. A dominant edge metric generator of smallest size of G is called a dominant edge metric basis for G. The size of a dominant edge metric basis of G is denoted by Ddime(G) and is called the dominant edge metric dimension. In this paper, the concept of dominant edge metric dimension (DEMD for short) is introduced and its basic properties are studied. Moreover, NP-hardness of computing DEMD of connected graphs is proved. Furthermore, this invariant is investigated under some graph operations at the end of the paper.

Kata kunci

Jaringan kolaborasi para penulis

18 penulis · 31 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Rinovia; Institut Teknologi Bandung SimanjuntakAfiliasi tidak diketahui2
Shariefuddin; University of Kashmir PirzadaAfiliasi tidak diketahui1
Mir Riyaz; University of Kashmir Ul RashidAfiliasi tidak diketahui1
Amir RehmanAfiliasi tidak diketahui1
Ketut Queena; Institut Teknologi Bandung FredlinaAfiliasi tidak diketahui1
Pritta Etriana; Institut Teknologi Bandung PutriAfiliasi tidak diketahui1
Yusuf; Institut Teknologi Bandung HafidhAfiliasi tidak diketahui1
Devi Imulia Dian; The University of Melbourne PrimaskunAfiliasi tidak diketahui1
Faisal; Institut Teknologi Bandung SusantoAfiliasi tidak diketahui1
Muhammad; Institut Teknologi Bandung RidwanAfiliasi tidak diketahui1
Hilda; Institut Teknologi Bandung AssiyatunAfiliasi tidak diketahui1
Anak Agung Gede; Universitas Merdeka Malang NgurahAfiliasi tidak diketahui1
A; Institut Teknologi Bandung AsmiatiAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">The dominant edge metric dimension of graphs</dc:title>
	<dc:creator>Tavakoli, Mostafa; Ferdowsi University of Mashhad</dc:creator>
	<dc:creator>Korivand, Meysam; Ferdowsi University of Mashhad</dc:creator>
	<dc:creator>Erfanian, Ahmad; Ferdowsi University of Mashhad</dc:creator>
	<dc:creator>Abrishami, Gholamreza; Ferdowsi University of Mashhad</dc:creator>
	<dc:creator>Baskoro, Edy Tri; Institut Teknologi Bandung</dc:creator>
	<dc:subject xml:lang="en-US">dominant edge metric generator, edge metric dimension, vertex cover</dc:subject>
	<dc:subject xml:lang="en-US">05C12, 05C76, 90C60</dc:subject>
	<dc:description xml:lang="en-US">For an ordered subset S = {v1, …, vk} of vertices in a connected graph G and an edge e′ of G, the edge metric S-representation of e′=ab is the vector rGe(e′|S)=(dG(e′,v1),…,dG(e′,vk)) , where dG(e′,vi)=min{dG(a, vi),dG(b, vi)}. A dominant edge metric generator for G is a vertex cover S of G such that the edges of G have pairwise different edge metric S-representations. A dominant edge metric generator of smallest size of G is called a dominant edge metric basis for G. The size of a dominant edge metric basis of G is denoted by Ddime(G) and is called the dominant edge metric dimension. In this paper, the concept of dominant edge metric dimension (DEMD for short) is introduced and its basic properties are studied. Moreover, NP-hardness of computing DEMD of connected graphs is proved. Furthermore, this invariant is investigated under some graph operations at the end of the paper.</dc:description>
	<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2023-04-08</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/1686</dc:identifier>
	<dc:identifier>10.5614/ejgta.2023.11.1.16</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications; 197 - 208</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/1686/pdf_264</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>