Jurnal
SINTA 1
Metric dimension of fullerene graphs
Electronic Journal of Graph Theory and Applications · Vol. 7 No. 1 (2019) · hlm. 91–103
ISSN 2338-2287
Terbit 2019-04-05
Penerbit GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa eng
Abstrak
A resolving set W is a set of vertices of a graph G(V, E) such that for every pair of distinct vertices u, v ∈ V(G), there exists a vertex w ∈ W satisfying d(u, w) ≠ d(v, w). A resolving set with minimum number of vertices is called metric basis of G. The metric dimension of G, denoted by dim(G), is the minimum cardinality of a resolving set of G. In this paper, we consider (3, 6)-fullerene and (4, 6)-fullerene graphs and compute the metric dimension for these fullerene graphs. We also give conjecture on the metric dimension of (3, 6)-fullerene and (4, 6)-fullerene graphs.
Jaringan kolaborasi para penulis
2 penulis ·
1 tautan kepenulisan bersama
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulis Organisasi Artikel bersama
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">Metric dimension of fullerene graphs</dc:title>
<dc:creator>Akhter, Shehnaz; School of Natural Sciences, National University of Sciences and Technology, H-12 Islamabad,
Pakistan</dc:creator>
<dc:creator>Farooq, Rashid; School of Natural Sciences, National University of Sciences and Technology, H-12 Islamabad,</dc:creator>
<dc:subject xml:lang="en-US">resolving set, metric dimension, fullerene graph</dc:subject>
<dc:description xml:lang="en-US">A resolving set W is a set of vertices of a graph G(V, E) such that for every pair of distinct vertices u, v ∈ V(G), there exists a vertex w ∈ W satisfying d(u, w) ≠ d(v, w). A resolving set with minimum number of vertices is called metric basis of G. The metric dimension of G, denoted by dim(G), is the minimum cardinality of a resolving set of G. In this paper, we consider (3, 6)-fullerene and (4, 6)-fullerene graphs and compute the metric dimension for these fullerene graphs. We also give conjecture on the metric dimension of (3, 6)-fullerene and (4, 6)-fullerene graphs.</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">Higher Education Commission of Pakistan under grant No. 20-3067/NRPU /R&D/HEC/12</dc:contributor>
<dc:date>2019-04-05</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/420</dc:identifier>
<dc:identifier>10.5614/ejgta.2019.7.1.7</dc:identifier>
<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 7, No 1 (2019): Electronic Journal of Graph Theory and Applications; 91–103</dc:source>
<dc:source>2338-2287</dc:source>
<dc:language>eng</dc:language>
<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/420/pdf_97</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2019 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 13 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref, doaj.
Sitasi artikel ini
APA 7
Akhter, S. S. o. N. S. N. U. o. S. a. T. H. 1. I. P., & Farooq, R. S. o. N. S. N. U. o. S. a. T. H. 1. I. (2019). Metric dimension of fullerene graphs. Electronic Journal of Graph Theory and Applications, 7(1), 91–103. https://doi.org/10.5614/ejgta.2019.7.1.7
Salin
IEEE
S. S. o. N. S. N. U. o. S. a. T. H. 1. I. P. Akhter and R. S. o. N. S. N. U. o. S. a. T. H. 1. I. Farooq, “Metric dimension of fullerene graphs,” Electronic Journal of Graph Theory and Applications, vol. 7, no. 1, pp. 91–103, 2019, doi: 10.5614/ejgta.2019.7.1.7.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.