On the Edge Metric Dimension of Different Families of Möbius Networks

Bo Deng, Muhammad Faisal Nadeem and Muhammad Azeem

Mathematical Problems in Engineering, 2021, vol. 2021, 1-9

Abstract:

For an ordered subset of vertices in a simple connected graph , a vertex distinguishes two edges , if . A subset having minimum vertices is called an edge metric generator for , if every two distinct edges of are distinguished by some vertex of . The minimum cardinality of an edge metric generator for is called the edge metric dimension, and it is denoted by . In this paper, we study the edge resolvability parameter for different families of Möbius ladder networks and we find the exact edge metric dimension of triangular, square, and hexagonal Möbius ladder networks.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/6623208.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/6623208.xml (text/xml)

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:hin:jnlmpe:6623208

DOI: 10.1155/2021/6623208

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().