Disjoint homometric sets in graph

DOI10.26493/1855-3974.174.027MaRDI QIDQ3119053zbMATH OpenOpenAlexWikidataFDO

Authors Michael O. Albertson, János Pach, Michael Young

Publication date 7 March 2012

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.174.027

zbMATH Keywords

graph distanceshomometric sets

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On homometric sets in graphs
• On homometric sets in graphs
• Subsets of vertices of the same size and the same maximum distance
• Homometric sets in trees
• Homometric number of a graph and some related concepts

Cited in

(10)

• Disconnected vertex sets and equidistant code pairs
• Homometric number of a graph and some related concepts
• Twin subgraphs and core-semiperiphery-periphery structures
• Twins in graphs
• Homometric sets in trees
• On homometric sets in graphs
• On homometric sets in graphs
• Uniform number of a graph
• Equal distances between equal sets of vertices in graphs
• Subsets of vertices of the same size and the same maximum distance

This page was built for publication: Disjoint homometric sets in graph

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