Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6423799 | Electronic Notes in Discrete Mathematics | 2011 | 4 Pages |
Abstract
For a vertex set SâV(G) in a graph G, the distance multiset is the multiset of pairwise distances of vertices of S in G, denoted by D(S). Two vertex sets S,TâV(G) are called homometric if D(S)=D(T). For a graph G, the largest integer h, such that there are two disjoint homometric sets of order h in G, is denoted by h(G). We investigate h(n)=minh(G) over all graphs on n vertices, as well as over special classes of graphs such as trees.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Maria Axenovich, Lale Ãzkahya,