On the minimal doubly resolving sets of Harary graph

zbMATH Open1478.05034MaRDI QIDQ5142452FDOQ5142452

Authors: Ali Ahmad, Martin Bača, Saba Sultan 

Publication date: 30 December 2020

Full work available at URL: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1032/795

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• Minimal doubly resolving sets of antiprism and Möbius ladders
• Minimal doubly resolving sets of necklace graph
• Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph
• Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph

zbMATH Keywords

metric dimensionresolving setHarary graphminimal doubly resolving set

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cited In (7)

• Minimal doubly resolving sets of prism graphs
• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• Minimal doubly resolving sets of antiprism and Möbius ladders
• Minimal doubly resolving sets of necklace graph
• Computation of the double metric dimension in convex polytopes
• A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
• On doubly resolving sets in graphs

This page was built for publication: On the minimal doubly resolving sets of Harary graph

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