Link dimension and exact construction of graphs from distance vectors

DOI10.1016/j.dam.2021.11.013zbMath1480.05047OpenAlexW4200190533WikidataQ114191479 ScholiaQ114191479MaRDI QIDQ2065779

Gunjan S. Mahindre, Anura P. Jayasumana

Publication date: 13 January 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.11.013

zbMATH Keywords

edgemetric dimensiongraph reconstructionlandmarkgraphabilityresolution set

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• The partition dimension of strong product graphs and Cartesian product graphs
• A table of connected graphs on six vertices
• The strong metric dimension of graphs and digraphs
• The energy of a graph
• Uniquely identifying the edges of a graph: the edge metric dimension
• Landmarks in graphs
• The Fractional Strong Metric Dimension of Graphs
• Strong metric dimension: A survey
• On the metric dimension of some families of graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Resolving domination in graphs
• The independent resolving number of a graph
• On Metric Generators of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Link dimension and exact construction of graphs from distance vectors