Fault-tolerant metric dimension of P(n, 2)ʘK1 graph

DOI10.1080/09720529.2021.1899209zbMath1483.05052arXiv1811.05973OpenAlexW3155314173MaRDI QIDQ5035114

Manzoor Ahmad Zahid, Maqbool Chaudhary, Zubair Ahmad, Abdul Qudair Baig

Publication date: 21 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.05973

zbMATH Keywords

basisPetersen graphresolving setmetric dimensionfault-tolerantcorona product

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

The study of the b-choromatic number of some classes of fractal graphs

Cites Work

• On \(k\)-dimensional graphs and their bases
• Resolvability in graphs and the metric dimension of a graph
• On the metric dimension of some families of graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Metric bases in digital geometry
• On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices
• On total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices
• Some polynomials of flower graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fault-tolerant metric dimension of P(n, 2)ʘK₁ graph