On symmetrical convex polytopes and their edge resolvability
From MaRDI portal
Publication:6625094
DOI10.61091/JCMCC122-19MaRDI QIDQ6625094
Sunny Kumar Sharma, V. K. Bhat
Publication date: 28 October 2024
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resolvability in graphs and the metric dimension of a graph
- Uniquely identifying the edges of a graph: the edge metric dimension
- On graphs with the maximum edge metric dimension
- On the edge dimension of a graph
- Edge metric dimension of some graph operations
- On some plane graphs and their metric dimension
- The vertex-edge resolvability of some wheel-related graphs
- Edge metric dimension of some generalized Petersen graphs
- Landmarks in graphs
- Metric bases in digital geometry
- The independent resolving number of a graph
- On Metric Generators of Graphs
- Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
- On partition dimension of some cycle-related graphs
This page was built for publication: On symmetrical convex polytopes and their edge resolvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6625094)
