On minimal edge version of doubly resolving sets of a graph
From MaRDI portal
Publication:6580148
DOI10.61091/JCMCC119-18zbMATH Open1544.05032MaRDI QIDQ6580148FDOQ6580148
Authors: Muhammad Ashfaq Ahmad, Zohaib Zahid, Sohail Zafar
Publication date: 29 July 2024
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Recommendations
- Minimal doubly resolving sets of prism graphs
- Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph
- Minimal doubly resolving sets of necklace graph
- On doubly resolving sets in graphs
- Graphs with doubly resolving number 2
Distance in graphs (05C12) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- On the Metric Dimension of Cartesian Products of Graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Landmarks in graphs
- Title not available (Why is that?)
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- Computing minimal doubly resolving sets of graphs
- Minimal doubly resolving sets of prism graphs
- On a conjecture on the diameter of line graphs of graphs of diameter two
- Counterexamples for properties of line graphs of graphs of diameter two
- Edge metric dimension of graphs.
This page was built for publication: On minimal edge version of doubly resolving sets of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580148)