Link dimension and exact construction of graphs from distance vectors
DOI10.1016/J.DAM.2021.11.013zbMATH Open1480.05047OpenAlexW4200190533WikidataQ114191479 ScholiaQ114191479MaRDI QIDQ2065779FDOQ2065779
Authors: 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
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- On the metric dimension of some families of graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Landmarks in graphs
- The local metric dimension of a graph
- Resolving domination in graphs
- The independent resolving number of a graph
- On Metric Generators of Graphs
- The strong metric dimension of graphs and digraphs
- A table of connected graphs on six vertices
- Title not available (Why is that?)
- The energy of a graph
- The fractional strong metric dimension of graphs
- Strong metric dimension: a survey
- Title not available (Why is that?)
- Uniquely identifying the edges of a graph: the edge metric dimension
- The partition dimension of strong product graphs and Cartesian product graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Link dimension and exact construction of graphs from distance vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065779)
