On the Constant Edge Resolvability of Some Unicyclic and Multicyclic Graphs

Dalal Alrowaili, Zohaib Zahid, Imran Siddique, Sohail Zafar, Muhammad Ahsan and Muhammad Sarwar Sindhu

Journal of Mathematics, 2022, vol. 2022, issue 1

Abstract: Assume that G = (V(G), E(G)) is a connected graph. For a set of vertices WE⊆V(G), two edges g1, g2 ∈ E(G) are distinguished by a vertex x1 ∈ WE, if d(x1, g1) ≠ d(x1, g2). WE is termed edge metric generator for G if any vertex of WE distinguishes every two arbitrarily distinct edges of graph G. Furthermore, the edge metric dimension of G, indicated by edim(G), is the cardinality of the smallest WE for G. The edge metric dimensions of the dragon, kayak paddle, cycle with chord, generalized prism, and necklace graphs are calculated in this article.

Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2022/6738129

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jjmath:v:2022:y:2022:i:1:n:6738129

Access Statistics for this article

More articles in Journal of Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().