๐ฎ
๐ฎ
The Ethereal
Link Dimension and Exact Construction of a Graph
June 13, 2019 ยท The Ethereal ยท ๐ Discrete Applied Mathematics
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Gunjan S. Mahindre, Anura P. Jayasumana
arXiv ID
1906.05916
Category
cs.DM: Discrete Mathematics
Cross-listed
cs.SI
Citations
1
Venue
Discrete Applied Mathematics
Last Checked
5 months ago
Abstract
Minimum resolution set and associated metric dimension provide the basis for unique and systematic labeling of nodes of a graph using distances to a set of landmarks. Such a distance vector set, however, may not be unique to the graph and does not allow for its exact construction. The concept of construction set is presented, which facilitates the unique representation of nodes and the graph as well as its exact construction. Link dimension is the minimum number of landmarks in a construction set. Results presented include necessary conditions for a set of landmarks to be a construction set, bounds for link dimension, and guidelines for transforming a resolution set to a construction set.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Discrete Mathematics
๐ฎ
๐ฎ
The Ethereal
An Introduction to Temporal Graphs: An Algorithmic Perspective
๐ฎ
๐ฎ
The Ethereal
Guarantees for Greedy Maximization of Non-submodular Functions with Applications
๐ฎ
๐ฎ
The Ethereal
A note on the triangle inequality for the Jaccard distance
๐ฎ
๐ฎ
The Ethereal
Fast clique minor generation in Chimera qubit connectivity graphs
๐ฎ
๐ฎ
The Ethereal