Computing metric dimension of two types of claw-free cubic graphs with applications

DOI10.61091/JCMCC119-17zbMATH Open1544.05033MaRDI QIDQ6580147FDOQ6580147

Shobha V. Patil, Muhammad Shoaib Sardar, S. J. Xu, M. Cancan, Mohammad Reza Farahani, Mehdi Alaeiyan

Publication date: 29 July 2024

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

metric dimensionresolving setcardinalityclaw-free cubic graphssimple connected graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40) Automated systems (robots, etc.) in control theory (93C85)

Cites Work

• On classes of regular graphs with constant metric dimension
• On families of convex polytopes with constant metric dimension
• Title not available (Why is that?)
• On the metric dimension of circulant graphs
• On \(k\)-dimensional graphs and their bases
• Landmarks in graphs
• On metric dimension of flower graphs \(f_{n \times m}\) and convex polytopes
• The metric dimension of Cartesian products of graphs
• Complexity of metric dimension on planar graphs
• On the metric dimension of Cayley graphs
• On the metric dimension of generalized tensor product of interval with paths and cycles
• On the metric dimension of the folded \(n\)-cube
• Metric dimension of fullerene graphs
• On graphs with the maximum edge metric dimension
• Edge metric dimension of some graph operations
• On the strong metric dimension of annihilator graphs of commutative rings
• Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\)
• Low-dimensional representation of genomic sequences
• Fault-tolerant resolvability of some graphs of convex polytopes

This page was built for publication: Computing metric dimension of two types of claw-free cubic graphs with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580147)