The K-Size Edge Metric Dimension of Graphs

Tanveer Iqbal, Muhammad Naeem Azhar, Syed Ahtsham Ul Haq Bokhary and Elena Guardo

Journal of Mathematics, 2020, vol. 2020, 1-7

Abstract: In this paper, a new concept k-size edge resolving set for a connected graph G in the context of resolvability of graphs is defined. Some properties and realizable results on k-size edge resolvability of graphs are studied. The existence of this new parameter in different graphs is investigated, and the k-size edge metric dimension of path, cycle, and complete bipartite graph is computed. It is shown that these families have unbounded k-size edge metric dimension. Furthermore, the k-size edge metric dimension of the graphs Pm □ Pn, Pm □ Cn for m, n ≥ 3 and the generalized Petersen graph is determined. It is shown that these families of graphs have constant k-size edge metric dimension.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2020/1023175.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2020/1023175.xml (application/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:jjmath:1023175

DOI: 10.1155/2020/1023175

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().