Computing edge version of metric and double metric dimensions of Kayak paddle graphs

DOI10.1142/S1793830920500706zbMath1457.05027MaRDI QIDQ5858180

No author found.

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

kayak paddle graphsedge version of doubly resolving sets and double metric dimensionedge version of resolving sets and metric dimension

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items

Computing vertex resolvability of some regular planar graphs ⋮ Computation of the double metric dimension in convex polytopes

Cites Work

• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• Computing minimal doubly resolving sets of graphs
• Edge version of metric dimension and doubly resolving sets of the necklace graph
• Landmarks in graphs
• Minimal doubly resolving sets of prism graphs
• Computing the metric dimension of kayak paddles graph and cycles with chord
• On the Metric Dimension of Cartesian Products of Graphs
• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing edge version of metric and double metric dimensions of Kayak paddle graphs