The Vertex-Edge Resolvability of Some Wheel-Related Graphs

Bao-Hua Xing, Sunny Kumar Sharma, Vijay Kumar Bhat, Hassan Raza, Jia-Bao Liu and Ali Ahmad

Journal of Mathematics, 2021, vol. 2021, 1-16

Abstract: A vertex w∈VH distinguishes (or resolves) two elements (edges or vertices) a,z∈VH∪EH if dw,a≠dw,z. A set Wm of vertices in a nontrivial connected graph H is said to be a mixed resolving set for H if every two different elements (edges and vertices) of H are distinguished by at least one vertex of Wm. The mixed resolving set with minimum cardinality in H is called the mixed metric dimension (vertex-edge resolvability) of H and denoted by m dimH. The aim of this research is to determine the mixed metric dimension of some wheel graph subdivisions. We specifically analyze and compare the mixed metric, edge metric, and metric dimensions of the graphs obtained after the wheel graphs’ spoke, cycle, and barycentric subdivisions. We also prove that the mixed resolving sets for some of these graphs are independent.

Date: 2021
References: Add references at CitEc
Citations:

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

DOI: 10.1155/2021/1859714

Access Statistics for this article

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