On homometric sets in graphs

MaRDI QIDQ2869302zbMATH OpenFDO

Authors Lale Özkahya, Maria Axenovich

Publication date 3 January 2014

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://ajc.maths.uq.edu.au/pdf/55/ajc_v55_p175.pdf

zbMATH Keywords

distance multisetgraphs of bounded diameter

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(8)

• Conic formulations of graph homomorphisms
• Disjoint homometric sets in graph
• 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
• Twins in graphs
• On homometric sets in graphs
• Equal distances between equal sets of vertices in graphs

This page was built for publication: On homometric sets in graphs

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