International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 7 846 – 850

_______________________________________________________________________________________________

Homometric Number of Graphs

Aparna Lakshmanan S.1, Manju K. Menon2 and Anu V.3

1
Department of Mathematics, St. Xavier’s College for Women, Aluva – 683 101, Kerala, India. E-mail : [email protected]
2
Department of Mathematics, St. Paul’s College, Kalamassery – 683 503, Kerala, India.
E-mail : [email protected]
3
Department of Mathematics, St. Peter’s College, Kolenchery – 682 311, Kerala, India.
E-mail : [email protected]

Abstract: Given a graph 𝐺 = (𝑉, 𝐸), two subsets 𝑆1 and 𝑆2 of the vertex set 𝑉 are homometric, if their distance multi sets are equal. The
homometric number 𝑕(𝐺) of a graph 𝐺 is the largest integer 𝑘 such that there exist two disjoint homometric subsets of cardinality 𝑘. We find
lower bounds for the homometric number of the Mycielskian of a graph and the join and the lexicographic product of two graphs. We also
obtain the homometric number of the double graph of a graph, the cartesian product of any graph with 𝐾2 and the complete bipartite graph. We
also introduce a new concept called weak homometric number and find weak homometric number of some graphs.

Keywords: Homometric sets, Homometric number, Weak Homometric number

AMS Subject Classification: 05C12

__________________________________________________*****_________________________________________________

I. Introduction Axenovich and Ӧzkahya [3] gave a better lower bound on

Let 𝐺 = (𝑉 𝐺 , 𝐸(𝐺)) be a graph with vertex set 𝑉(𝐺) and the maximal size of homometric sets in trees. They showed
edge set 𝐸(𝐺). If there is no ambiguity in the choice of 𝐺, that every tree on 𝑛 vertices contain homometric sets of size
3
then we write 𝑉(𝐺) and 𝐸(𝐺) as 𝑉 and 𝐸 respectively. For at least 𝑛. A haircomb tree on 𝑛 vertices contains
any set 𝑆 ⊆ 𝑉 the cardinality of 𝑆 is denoted by |𝑆|. The 𝑛
homometric sets of size at least . They also proved that,
distance multi set of 𝑆, denoted by 𝐷𝑀(𝑆), is the multi set 2
1
of all pair-wise distances between any two vertices of 𝑆. for any graph 𝐺 of diameter 𝑑, 𝑕 𝐺 ≥ 𝑐𝑛2𝑑 −2 . R. Fulek
Two subsets 𝑆1 and 𝑆2 of the vertex set 𝑉 are said to be and S. Mitrović [6] improved the result on trees by proving
homometric, if their distance multi sets are equal. The that there exist disjoint homometric sets of size at least
homometric number 𝑕(𝐺) of a graph 𝐺 is the largest integer 𝑛 1
− . A better lower bound for haircomb trees is also
𝑘 such that there exist two disjoint homometric subsets, 𝑆1 2 2

and 𝑆2 of the vertex set 𝑉, each of cardinality 𝑘. Clearly, given in [6]. Lemke, Skiena and Smith [8] showed that if 𝐺
𝑕 𝐺 ≤ ⌊2𝑛 ⌋, where ⌊𝑥⌋ denotes the greatest whole number is a cycle of length 2𝑛 then every subset of 𝑉(𝐺) with 𝑛
less than or equal to 𝑥. Even though there is a concept of vertices and its complement are homometric sets. In [2], it is
infinite distance in the case of disconnected graphs, to avoid proved that the above result works not only for cycles but
ambiguity we consider only connected graphs. For a family for all vertex transitive graphs.
of graphs 𝒢, 𝑕(𝒢) is the largest integer 𝑕 such that 𝑕(𝐺) ≥
𝑕, for every 𝐺 ∈ 𝒢. For any positive integer 𝑛, 𝑕 𝑛 = 1.1 Basic Definitions and Preliminaries
𝑕(𝒢𝑛 ), where 𝒢𝑛 denotes the class of all graphs on 𝑛 For any graph 𝐺 the number of vertices in 𝐺 is denoted by
vertices. 𝑛(𝐺). For any vertex 𝑣 ∈ 𝑉 the degree of 𝑣, denoted by
𝑑𝐺 (𝑣), is the number of edges incident to 𝑣. The distance
In 2010, Albertson, Pach and Young [1] initiated the study between any two vertices 𝑢 and 𝑣 in 𝑉 is the length of the
of homometric sets in graphs. They proved that every graph shortest path joining 𝑢 and 𝑣 in 𝐺 and is denoted by
on 𝑛 vertices, 𝑛 > 3, contains homometric sets of size at 𝑑𝐺 (𝑢, 𝑣). The maximum distance between any pair of
𝑐 𝑙𝑜𝑔 𝑛 vertices in 𝐺 is the diameter of the graph 𝐺 and is denoted
least , for a constant 𝑐. On the other hand, they
log log 𝑛 by 𝑑𝑖𝑎𝑚(𝐺). Any induced path 𝑃 = 𝑢1 , 𝑢2 , … , 𝑢𝑙 in 𝐺
constructed a class of graphs where the size of homometric where 𝑑𝐺 𝑢1 , 𝑢𝑙 = 𝑑𝑖𝑎𝑚(𝐺) is called a diametral path with
𝑛
sets cannot exceed , where𝑛 > 3. The lower bound was end vertices 𝑢1 and 𝑢𝑙 . Since {𝑢1 , 𝑢2 , … , 𝑢 𝑙 } and
4
2
𝑐 (log 𝑛)2
apparently improved by Alon in [11] as 𝑕 𝑛 ≥ . {𝑢 𝑙 , … , 𝑢2 𝑙 } are disjoint homometric subsets,
(log log 𝑛)2 +1
2 2

846
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 846 – 850
_______________________________________________________________________________________________
𝑑𝑖𝑎𝑚 𝐺 we introduce a new concept called weak homometric
⌈ ⌉ ≤ 𝑕(𝐺), where ⌈𝑥⌉ denotes the least whole number
2
number and find weak homometric number of some graphs.
greater than or equal to 𝑥.

A subset 𝑆 ⊆ 𝑉 of vertices is said to be independent if no

II. Lower Bounds of Homometric Number
two vertices of 𝑆 are adjacent to each other in 𝐺. The
In this section we find lower bounds for the homometric
maximum cardinality of an independent set of vertices in 𝐺
number of the Mycielskian of a graph 𝐺. We also obtain
is the independence number, denoted by ⍺(𝐺). The girth of
lower bounds for the homometric number of the join and the
a graph 𝐺 is the length of the shortest cycle in 𝐺 and is
lexicographic product of two graphs.
denoted by 𝑔(𝐺).
Theorem 2.1. For any connected graph 𝐺, 𝑕(𝑀(𝐺)) ≥
The Mycielskian 𝑀(𝐺) of a graph 𝐺 is the graph with vertex
2𝑕(𝐺).
set 𝑉 𝐺 ∪ 𝑉 ′ 𝐺 ∪ {𝑤} where 𝑉 ′ 𝐺 = {𝑣𝑖 : 𝑢𝑖 ∈ 𝑉(𝐺)}
Proof. Let 𝑢1 , 𝑢2 , … , 𝑢𝑛 be the vertex set of 𝐺. In 𝑀(𝐺),
and edge set 𝐸 𝐺 ∪ 𝑢𝑖 𝑣𝑗 : 𝑢𝑖 𝑢𝑗 ∈ 𝐸 𝐺 ∪ {𝑤𝑣𝑖 : 𝑣𝑖 ∈ for 𝑖 = 1,2, … , 𝑛, let 𝑣𝑖 be the vertex corresponding to 𝑢𝑖
𝑉 ′ (𝐺)}. In [5], it has been proved that for a connected and 𝑤 be the vertex adjacent to all the 𝑣𝑖 ’s. Let 𝑆1 =
noncomplete graph 𝐺, 𝑑𝑖𝑎𝑚 𝑀 𝐺 = min⁡ {𝑑𝑖𝑎𝑚 𝐺 , 4}. u11 , u12 , … , u1h and 𝑆2 = {𝑢21 , 𝑢22 , … , 𝑢2𝑕 } be two
disjoint homometric subsets of 𝑉(𝐺) such that 𝑆1 =
The join of two graphs 𝐺 and 𝐻, denoted by 𝐺 ∨ 𝐻, is 𝑆2 = 𝑕(𝐺).
defined as the graph with 𝑉 𝐺 ∨ 𝐻 = 𝑉(𝐺) ∪ 𝑉(𝐻) and Consider two subsets
𝐸 𝐺 ∨ 𝐻 = 𝐸 𝐺 ∪ 𝐸 𝐻 ∪ {𝑢𝑣, 𝑤𝑕𝑒𝑟𝑒 𝑢 ∈ 𝑆1′ = {𝑢11 , 𝑢12 , . . . , 𝑢1𝑕 , 𝑣11 , v12 , … 𝑣1𝑕 } and 𝑆2′ =
𝑉 𝐺 𝑎𝑛𝑑 𝑣 ∈ 𝑉(𝐻)}. The cartesian product of two graphs {𝑢21 , 𝑢22 , … , 𝑢2𝑕 , 𝑣21 , 𝑣22 , … , 𝑣2𝑕 } of 𝑉(𝑀(𝐺)).
𝐺 and 𝐻, denoted by 𝐺□𝐻, is the graph with vertex set Clearly, 𝑆1′ = 𝑆2′ = 2𝑕(𝐺).
𝑉(𝐺) × 𝑉(𝐻) and any two vertices (𝑢1 , 𝑣1 ) and (𝑢2 , 𝑣2 ) are
adjacent in 𝐺□𝐻 if (i) 𝑢1 = 𝑢2 and 𝑣1 𝑣2 ∈ 𝐸(𝐻), or (ii) Case 1: Consider 𝑢1𝑖 , 𝑢1𝑗 ∈ 𝑆1 ′.
𝑢1 𝑢2 ∈ 𝐸(𝐺) and 𝑣1 = 𝑣2 . It is known that [7], if (𝑢1 , 𝑣1 ) Since 𝑆1 and 𝑆2 are two disjoint homometric subsets of
and (𝑢2 , 𝑣2 ) are two vertices in 𝐺□𝐻, then 𝑑𝐺□𝐻 ((𝑢1 , 𝑣1 ) 𝑉 𝐺 , there exist 𝑢2𝑘 , 𝑢2𝑙 ∈ 𝑆2 such that 𝑑𝐺 𝑢1𝑖 , 𝑢1𝑗 =
(𝑢2 , 𝑣2 )) = 𝑑𝐺 𝑢1 , 𝑢2 + 𝑑𝐻 𝑣1 , 𝑣2 . The lexicographic
𝑑𝐺 (𝑢2𝑘 , 𝑢2𝑙 ). If 𝑑𝐺 𝑢1𝑖 , 𝑢1𝑗 ≤ 4, then 𝑑𝑀(𝐺) 𝑢1𝑖 , 𝑢1𝑗 =
product of two graphs 𝐺 and 𝐻 is the graph 𝐺[𝐻] with
𝑑𝐺 𝑢1𝑖 , 𝑢1𝑗 = 𝑑𝐺 (𝑢2𝑘 , 𝑢2𝑙 ) = 𝑑𝑀(𝐺) (𝑢2𝑘 , 𝑢2𝑙 ). If
vertex set 𝑉(𝐺) × 𝑉(𝐻) and any two vertices (𝑢1 , 𝑣1 ) and
(𝑢2 , 𝑣2 ) are adjacent in 𝐺[𝐻] if and only if (i) 𝑢1 𝑢2 ∈ 𝐸(𝐺), 𝑑𝐺 𝑢1𝑖 , 𝑢1𝑗 > 4, then
or (ii) 𝑢1 = 𝑢2 and 𝑣1 𝑣2 ∈ 𝐸(𝐻). In [7], it is proved that 𝑑𝑀(𝐺) 𝑢1𝑖 , 𝑢1𝑗 = 𝑑𝑀(𝐺) (𝑢2𝑘 , 𝑢2𝑙 ) = 4.
if (𝑢1 , 𝑣1 ) and (𝑢2 , 𝑣2 ) are two vertices in 𝐺[𝐻], then
𝑑𝐺 𝐻 (𝑢1 , 𝑣1 , (𝑢2 , 𝑣2 )) Case 2: Consider 𝑢1𝑖 , 𝑣1𝑗 ∈ 𝑆1 ′.
𝑑𝐺 𝑢1 , 𝑢2 , 𝑖𝑓 𝑢1 ≠ 𝑢2 , Corresponding to every 𝑣1𝑗 ∈ 𝑆1 ′ there exists 𝑢1𝑗 ∈ 𝑆1 ′ . By
= 𝑑𝐻 𝑣1 , 𝑣2 , 𝑖𝑓 𝑢1 = 𝑢2 𝑎𝑛𝑑 𝑑𝐺 𝑢1 = 0, Case 1, there exist 𝑢2𝑘 , 𝑢2𝑙 ∈ 𝑆2 ′ such that
min 𝑑𝐻 𝑣1 , 𝑣2 , 2 , 𝑖𝑓 𝑢1 = 𝑢2 𝑎𝑛𝑑 𝑑𝐺 𝑢1 ≠ 0. 𝑑𝑀(𝐺) 𝑢1𝑖 , 𝑢1𝑗 = 𝑑𝑀(𝐺) (𝑢2𝑘 , 𝑢2𝑙 ). Corresponding to every
𝑢2𝑙 ∈ 𝑆2 ′ there exists 𝑣2𝑙 ∈ 𝑆2 ′. Clearly, 𝑑𝑀(𝐺) 𝑢1𝑖 , 𝑣1𝑗 =
The double graph 𝐷(𝐺) [10] of a graph 𝐺 is the
𝑑𝑀(𝐺) (𝑢2𝑙 , 𝑣2𝑘 ).
lexicographic product of 𝐺
Case 3: Consider 𝑣1𝑖 , 𝑣1𝑗 ∈ 𝑆1 ′.
and 𝐾2 ′, where 𝐾2 ′ denotes the complement of 𝐾2 .
Clearly, 𝑑𝑀(𝐺) 𝑣1𝑖 , 𝑣1𝑗 = 2. Choose 𝑣2𝑖 , 𝑣2𝑗 ∈ 𝑆2 ′. By the
For any graph theoretic terminology and construction of 𝑀(𝐺), 𝑑𝑀(𝐺) 𝑣2𝑖 , 𝑣2𝑗 is also two.
notations not mentioned here, the readers may refer [4].
Thus, 𝑆1 ′ and 𝑆2 ′ are disjoint homometric subsets of
1.2 Our Results 𝑉(𝑀(𝐺)) each of cardinality 2𝑕(𝐺). Hence, 𝑕(𝑀(𝐺)) ≥
In this paper, we prove that the homometric number of 2𝑕(𝐺).
Mycielskian of a graph 𝐺 is at least twice as that of 𝐺. We □
also obtain lower bounds for the homometric number of the
join and the lexicographic product of two graphs. Further, Theorem 2.2. For any two connected graphs 𝐺 and 𝐻, the
we find the homometric number of the double graph of a homometric number of 𝐺 ∨ 𝐻,
graph on 𝑛 vertices, the cartesian product of any graph on 𝑛 𝑕(𝐺 ∨ 𝐻) ≥
vertices with 𝐾2 , and the complete bipartite graph. Finally max⁡{min 𝛼 𝐺 , 𝛼 𝐻 , min⁡ {𝑑𝑖𝑎𝑚(𝐺), 𝑑𝑖𝑎𝑚(𝐻)}}.
847
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 846 – 850
_______________________________________________________________________________________________
Proof. If 𝑆1 and 𝑆2 are independent subsets of 𝑉(𝐺) and III. Homometric Number of Some Graphs
𝑉(𝐻) respectively and 𝑆1 = |𝑆2 |, then 𝐷𝑀(𝑆1 ) and In this section we obtain the homometric number of the
𝐷𝑀(𝑆2 ) in 𝐺 ∨ 𝐻 contains only the element 2, repeated the double graph of a graph, the cartesian product of a graph
same number of times. Hence 𝑆1 and 𝑆2 are two disjoint with 𝐾2 and the complete bipartite graph.
homometric subsets of 𝑉(𝐺 ∨ 𝐻). Therefore, 𝑕(𝐺 ∨ 𝐻) ≥
min 𝛼 𝐺 , 𝛼 𝐻 . Theorem 3.1. For any connected graph 𝐺, 𝑕 𝐷 𝐺 = 𝑛,
where 𝑛 denotes the number of vertices of 𝐺.
Let 𝑑 = 𝑚𝑖𝑛⁡ {𝑑𝑖𝑎𝑚(𝐺), 𝑑𝑖𝑎𝑚(𝐻)}. Let 𝑆1 and 𝑆2 be the Proof. Let 𝐺 be any connected graph with vertex set
vertices in an induced path of length 𝑑 in 𝐺 and 𝐻 {𝑢1 , 𝑢2 , … , 𝑢𝑛 } and let the vertices of 𝐾2 ′ be 𝑣1 and 𝑣2 .
respectively. Then, in 𝐺 ∨ 𝐻, 𝐷𝑀 𝑆1 = 𝐷𝑀 𝑆2 = Consider the subsets 𝑆1 = { 𝑢1 , 𝑣1 , 𝑢2 , 𝑣1 , … , 𝑢𝑛 , 𝑣1 }
{1, … ,1, 2, … , 2}, where 1 is repeated 𝑑 times and 2 is and 𝑆2 = { 𝑢1 , 𝑣2 , 𝑢2 , 𝑣2 , … , 𝑢𝑛 , 𝑣2 } of 𝑉(𝐷(𝐺)).
repeated d+1𝐶2 − 𝑑 times. Thus, 𝑆1 and 𝑆2 are disjoint Clearly, 𝐷𝑀 𝑆1 = 𝐷𝑀 𝑆2 = 𝐷𝑀(𝑉(𝐺)). Therefore,
homometric subsets of 𝑉(𝐺 ∨ 𝐻) of cardinality 𝑕(𝐷(𝐺)) ≥ 𝑛. But, the maximum value of the homometric
min{𝑑𝑖𝑎𝑚 𝐺 , 𝑑𝑖𝑎𝑚(𝐻)}. Therefore, 𝑕(𝐺 ∨ 𝐻) ≥ number of any graph cannot exceed the half of its order.
𝑚𝑖𝑛⁡ {𝑑𝑖𝑎𝑚(𝐺), 𝑑𝑖𝑎𝑚(𝐻)}. Thus, 𝑕 𝐷 𝐺 ≤
2𝑛
= 𝑛 always. Hence the result. □
2

Hence, 𝑕(𝐺 ∨ 𝐻) ≥
Theorem 3.2. For any connected graph 𝐺, 𝑕 𝐺 □ 𝐾2 = 𝑛,
max⁡{min 𝛼 𝐺 , 𝛼 𝐻 , 𝑚𝑖 𝑛 𝑑𝑖𝑎𝑚 𝐺 , 𝑑𝑖𝑎𝑚 𝐻 }.
where 𝑛 denotes the number of vertices of 𝐺.
□
Proof. Let 𝐺 be any connected graph with vertex set
{𝑢1 , 𝑢2 , … , 𝑢𝑛 } and the vertices of 𝐾2 be 𝑣1 and 𝑣2 . Consider
Theorem 2.3. For any two connected graphs 𝐺 and 𝐻,
the subsets 𝑆1 = { 𝑢1 , 𝑣1 , 𝑢2 , 𝑣1 , … , 𝑢𝑛 , 𝑣1 } and
𝑕(𝐺 𝐻 ) ≥ 𝑕 𝐺 𝑛(𝐻).
𝑆2 = { 𝑢1 , 𝑣2 , 𝑢2 , 𝑣2 , … , 𝑢𝑛 , 𝑣2 } of 𝑉 𝐺 □ 𝐾2 .
Proof. Let 𝑆1 = {𝑢11 , 𝑢12 , … , 𝑢1𝑕 } and
Clearly, 𝐷𝑀 𝑆1 = 𝐷𝑀 𝑆2 = 𝐷𝑀(𝑉(𝐺)). Therefore,
𝑆2 = {𝑢21 , 𝑢22 , … , 𝑢2𝑕 } be two disjoint homometric subsets
𝑕 𝐺 □ 𝐾2 ≥ 𝑛. But, the maximum value of the
of 𝑉(𝐺). Let 𝑉 𝐻 = {𝑣1 , 𝑣2 , … , 𝑣𝑛 }. Consider two subsets
homometric number of any graph cannot exceed the half of
of 𝑉(𝐺[𝐻]), 𝑆1 ′ = {(𝑢1𝑖 , 𝑣𝑗 ) ∕ 𝑖 = 1, 2, … , 𝑕 𝑎𝑛𝑑 𝑗 = 2𝑛
1, 2, … , 𝑛} and 𝑆2 ′ = {(𝑢2𝑖 , 𝑣𝑗 ) ∕ 𝑖 = 1, 2, … , 𝑕 𝑎𝑛𝑑 𝑗 = its order. Thus, 𝑕(𝐺□𝐻) ≤ = 𝑛 always. Hence the
2

1, 2, … , 𝑛}. Clearly, 𝑆1 ′ = |𝑆2 ′| = 𝑕 𝐺 𝑛(𝐻). Let (𝑢1𝑖 , 𝑣𝑥 ) result.

and (𝑢1𝑗 , 𝑣𝑦 ) be any two vertices in 𝑆1 ′. □

Case 1: i ≠ j. Theorem 3.3. For any complete bipartite graph 𝐾𝑚 ,𝑛 ,

𝑚, 𝑖𝑓 𝑚 = 𝑛,
In this case, 𝑑𝐺 𝐻 𝑢1𝑖 , 𝑣𝑥 , 𝑢1𝑗 , 𝑣𝑦 = 𝑑𝐺 (𝑢1𝑖 , 𝑢1𝑗 ). 𝑕 𝐾𝑚 ,𝑛 = 𝑚 𝑛
+ , 𝑖𝑓 𝑚 ≠ 𝑛.
Since 𝑆1 and 𝑆2 are two homometric subsets of 𝑉(𝐺) there 2 2
exist two vertices 𝑢2𝑘 , 𝑢2𝑙 ∈ 𝑆2 such that 𝑑𝐺 𝑢1𝑖 , 𝑢1𝑗 = Proof. Let 𝑋 = 𝑢1 , 𝑢2 , … , 𝑢𝑚 and 𝑌 = 𝑣1 , 𝑣2 , … , 𝑣𝑛 be a
bipartition of 𝐾𝑚 ,𝑛 . If 𝑚 = 𝑛, then 𝑋 and 𝑌 itself are
𝑑𝐺 𝑢2𝑘 , 𝑢2𝑙 . So, 𝑑𝐺 𝐻 𝑢2𝑘 , 𝑣𝑥 , 𝑢2𝑙 , 𝑣𝑦 =
disjoint homometric sets. Now without loss of generality let
𝑑𝐺 𝐻 𝑢1𝑖 , 𝑣𝑥 , 𝑢1𝑗 , 𝑣𝑦 . Also, 𝑢2𝑘 , 𝑣𝑥 , (𝑢2𝑙 , 𝑣𝑦 ) ∈
𝑚 > 𝑛. Let 𝑆1 = 𝑢1 , 𝑢2 , … , 𝑢 𝑚 , 𝑣1 , 𝑣2 , … , 𝑣 𝑛 and
𝑆2 ′ . 2 2

𝑆2 = 𝑢 𝑚 +1
, … , 𝑢2 𝑚 , 𝑣 𝑛 +1
, … 𝑣2 𝑛 . Then S1 and S2 are
2 2 2 2
Case 2: i = j. disjoint homometric sets with distance multi set containing
In this 𝑚 𝑛
⌊m/2⌋𝐶 +⌊n/2⌋𝐶2 two’s and one’s. Hence
2 2 2
case, 𝑑𝐺 𝐻 𝑢1𝑖 , 𝑣𝑥 , 𝑢1𝑗 , 𝑣𝑦 = min 𝑑𝐻 𝑣𝑥 , 𝑣𝑦 , 2 = 𝑚 𝑛
homometric number is at least + . If 𝑚 or 𝑛 is even
𝑑𝐺𝐻𝑢2𝑖, 𝑣𝑥, 𝑢2𝑗, 𝑣𝑦 . Also, 𝑢2𝑖, 𝑣𝑥,(𝑢2𝑗, 𝑣𝑦 ∈𝑆2′. 2 2
𝑚 𝑛 𝑚 +𝑛
then + = , which is the maximum possible
2 2 2
value. Therefore, we need only consider the case where both
Hence, we have proved that corresponding to any two 𝑚 and 𝑛 are odd. If possible assume that 𝑆1 and 𝑆2 are
vertices in 𝑆1 ′, there exists a pair of vertices in 𝑆2 ′ such that disjoint homometric sets such that 𝑆1 ∪ 𝑆2 = 𝑉(𝐾𝑚 ,𝑛 ). Let
the distance is preserved. Thus 𝑆1 ′ and 𝑆2 ′ are two disjoint 𝑆1 ∩ 𝑋 = 𝑚1 , 𝑆1 ∩ 𝑌 = 𝑛1 , 𝑆2 ∩ 𝑋 = 𝑚2 and 𝑆2 ∩
homometric subsets of 𝑉(𝐺[𝐻]). Hence, 𝑕(𝐺 𝐻 ) ≥ 𝑌 = 𝑛2 . Since 𝑆1 and 𝑆2 are homometric, 𝑆1 = 𝑚1 +
𝑕 𝐺 𝑛(𝐻). □ 𝑛1 = 𝑚2 + 𝑛2 = |𝑆2 |. Also, since the number of one’s in

848
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 846 – 850
_______________________________________________________________________________________________
𝐷𝑀(𝑆1 ) is 𝑚1 𝑛1 and that in 𝐷𝑀(𝑆2 ) is 𝑚2 𝑛2 , 𝑚1 𝑛1 = Thus, 𝐷 𝑆1 = 𝐷(𝑆2 ). Now there are 𝑛 − 2𝑑 vertices
𝑚2 𝑛2 . Using these two equations and the fact that, 𝑚1 ≠ remaining in 𝑉. Put
𝑛−2𝑑
vertices in 𝑆1 and 𝑆2 so that
2
𝑚2 , we get 𝑚1 = 𝑛2 and 𝑚2 = 𝑛1 . But this contradicts the 𝑛
fact that 𝑚1 + 𝑚2 = 𝑚 ≠ 𝑛 = 𝑛1 + 𝑛2 . Hence we can 𝑆1 = 𝑆2 = .
2
conclude that the homometric number in this case is
𝑚
+
𝑛
. Case 2. 𝑑 is odd.
2 2
Let 𝑣1 , 𝑣2 ,…,𝑣𝑑+1 ∈ 𝑆1 and 𝑣𝑑+3 ,…, 𝑣𝑑+1 ∈ 𝑆2 . Since
□ 2 2
𝑑 𝑣𝑖 ≠ 2, every 𝑣𝑖 , 𝑖 = 2, … , 𝑑, has at least one neighbour
IV. Weak Homometric Number other than 𝑣𝑖−1 and 𝑣𝑖+1 . For each 𝑖 = 2, … , 𝑑, let 𝑢𝑖 be
In the definition of homometric number we consider adjacent to 𝑣𝑖 . Put 𝑢2 ,…,𝑢𝑑+1 in 𝑆2 and 𝑢𝑑 +3 , … , 𝑢𝑑 in 𝑆1 .
2 2
distance multi set of subsets of the vertex set. In some 𝑑+1
practical situations only distances are important and not the Clearly, 𝑑 𝑣1 , 𝑣𝑖 = 𝑖 − 1, ∀𝑖 = 2, … , . Hence,
2
𝑑−1 𝑑 +3
number of pairs of vertices at a particular distance. For 1, 2, … , ∈ 𝐷(𝑆1 ). Also, 𝑑 𝑣1 , 𝑢𝑖 = 𝑖, ∀𝑖 = , … , 𝑑.
2 2
example, while considering communication delay we are 𝑑 +3 𝑑+1
interested in how far the communication centers are, but not Hence, , … , 𝑑 ∈ 𝐷(𝑆1 ). Again, 𝑑 𝑣2 , 𝑢𝑑+3 = .
2 2
2
in how many communication centers are there at a fixed 𝑑+1
Therefore, ∈ 𝐷(𝑆1 ). Hence, 𝐷 𝑆1 = {1, 2, … , 𝑑}.
2
distance. With this in mind, we are introducing a new
concept called weak homometric number. 𝑑+3
For any set 𝑆 ⊆ 𝑉, the distance set of 𝑆, denoted by 𝐷(𝑆), Now, 𝑑 𝑣𝑑 +1 , 𝑣𝑖 = 𝑑 + 1 − 𝑖, ∀𝑖 = , … , 𝑑. Hence,
2
𝑑−1
is the set of all pair-wise distances between any two vertices 1,2, … , ∈ 𝐷(𝑆2 ). Also, 𝑑 𝑣𝑑+1 , 𝑢𝑖 = 𝑑 + 2 − 𝑖, ∀𝑖 =
2
of 𝑆. Two subsets 𝑆1 and 𝑆2 of the vertex set 𝑉 are said to 𝑑+1 𝑑+3
be weakly homometric if their distance sets are equal [9]. 2, … , . Hence, , … , 𝑑 ∈ 𝐷(𝑆2 ). Again, 𝑑 𝑣𝑑 , 𝑢𝑑 +1 =
2 2 2
The weak homometric number of a graph 𝐺 is the largest 𝑑+1
. Therefore,
𝑑+1
∈ 𝐷(𝑆2 ). Hence, 𝐷 𝑆2 = {1, 2, … , 𝑑}.
2 2
integer 𝑘 such that there exist two disjoint weakly
Thus, 𝐷 𝑆1 = 𝐷(𝑆2 ). Now there are 𝑛 − 2𝑑 vertices
homometric subsets 𝑆1 and 𝑆2 of the vertex set 𝑉 each of 𝑛−2𝑑
cardinality 𝑘 and it is denoted by 𝑕𝑤 (𝐺). Clearly 𝑕 𝐺 ≤ remaining in 𝑉. Put vertices in 𝑆1 and 𝑆2 so that
2
𝑛 𝑛
𝑕𝑤 𝐺 ≤ . 𝑆1 = 𝑆2 = .
2 2

Theorem 4.1. If 𝐺 is a connected graph with 𝑛 vertices, Thus, in both the cases we have proved that 𝑆1 and 𝑆2 are
𝑔(𝐺) ≥ 5 and 𝑑(𝑣) ≠ 2, ∀ 𝑣 ∈ 𝑉(𝐺), then 𝑕𝑤 𝐺 =
𝑛
. two disjoint weakly homometric subsets of 𝑉(𝐺) and hence
2 𝑛
Proof. Let 𝑣1 𝑣2 … 𝑣𝑑 +1 be a diametral path in 𝐺. 𝑕𝑤 𝐺 = . □
2

Case 1. 𝑑 is even. Theorem 4.2. If 𝐺 and 𝐻 are any two noncomplete graphs
Let 𝑣1 , 𝑣2 ,…,𝑣𝑑 +1 ∈ 𝑆1 and 𝑣𝑑 +2 ,…,𝑣𝑑 +1 ∈ 𝑆2 . Since with 𝑛1 and 𝑛2 vertices respectively, then 𝑕𝑤 𝐺 ∨ 𝐻 =
2 2 𝑛 1 +𝑛 2
𝑑 𝑣𝑖 ≠ 2, every 𝑣𝑖 , 𝑖 = 2, … , 𝑑, has at least one neighbour .
2
other than 𝑣𝑖−1 and 𝑣𝑖+1 . For each 𝑖 = 2, … , 𝑑, let 𝑢𝑖 be Proof. Let 𝑉 𝐺 = {𝑢1 , 𝑢2 , … , 𝑢𝑛 1 } and 𝑉 𝐻 =
adjacent to 𝑣𝑖 . Put 𝑢2 ,…,𝑢𝑑 +1 in 𝑆2 and 𝑢𝑑 +2 , … , 𝑢𝑑 in 𝑆1 . {𝑣1 , 𝑣2 , … , 𝑣𝑛 2 }. Suppose that 𝑢1 and 𝑢2 are two nonadjacent
2 2
𝑑 vertices in 𝐺 and 𝑣1 and 𝑣2 are two nonadjacent vertices in
Clearly, 𝑑 𝑣1 , 𝑣𝑖 = 𝑖 − 1, ∀𝑖 = 2, … , + 1. Hence,
2 𝐻.
𝑑 𝑑
1, 2, … , ∈ 𝐷(𝑆1 ). Also, 𝑑 𝑣1 , 𝑢𝑖 = 𝑖, ∀𝑖 = + 2, … , 𝑑.
2 2
𝑑 𝑑 Case 1. n1 , n2 ≥ 3.
Hence, + 2, … , 𝑑 ∈ 𝐷(𝑆1 ). Again, 𝑑 𝑣2 , 𝑢𝑑 +2 = + 1.
2 2
2 Put 𝑢1 , 𝑢2 and 𝑣3 in 𝑆1 and 𝑣1 , 𝑣2 and 𝑢3 in 𝑆2 .
𝑑
Therefore, + 1 ∈ 𝐷(𝑆1 ). Hence, 𝐷 𝑆1 = {1, 2, … , 𝑑}. Hence 𝐷 𝑆1 = 𝐷 𝑆2 = {1, 2}. Now there are 𝑛1 + 𝑛2 − 6
2
vertices remaining in 𝑉(𝐺 ∨ 𝐻). Distribute these vertices in
𝑛 1 +𝑛 2
𝑆1 and 𝑆2 so that 𝑆1 = 𝑆2 = . Now, 𝑑 𝑣
2

Case 2. Either 𝑛1 or 𝑛2 (but not both) is 2.

Let 𝑛1 = 2. (The other case follows similarly.) If 𝑛2 = 3,
then take 𝑆1 = {𝑢1 , 𝑢2 } and 𝑆2 = {𝑣1 , 𝑣2 }. Now, suppose
𝑛2 ≥ 4. If 𝑣𝑖 and 𝑣𝑗 , 𝑖, 𝑗 ≠ 1,2, are non adjacent in 𝐻, then
849
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
 International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 846 – 850
_______________________________________________________________________________________________
put 𝑣1 , 𝑣2 and 𝑢1 in 𝑆1 and 𝑣𝑖 , 𝑣𝑗 and 𝑢2 in 𝑆2 . Hence, [11] Noga Alon, “Problems and results in Extremal
𝐷 𝑆1 = 𝐷 𝑆2 = {1, 2}. Distribute the remaining 𝑛2 − 4 Combinatorics-III”, Journal of Combinatorics, 7(2-3)
𝑛 1 +𝑛 2 (2016), 233-256.
vertices in 𝑆1 and 𝑆2 so that 𝑆1 = 𝑆2 = .
2
Otherwise, {𝑣3 , 𝑣4 , … , 𝑣𝑛 2 } will induce a complete subgraph
𝐻1 in 𝐻. If there is no 𝑣1 𝑣𝑖 and 𝑣2 𝑣𝑖 , 𝑖 = 3, 4, … , 𝑛2 , edge,
then put 𝑢1 and 𝑣1 in 𝑆1 and 𝑢2 and 𝑣2 in 𝑆2 . Thus, 𝐷 𝑆1 =
𝐷 𝑆2 = {1}. Distribute the remaining 𝑛2 − 2 vertices in 𝑆1
𝑛 1 +𝑛 2
and 𝑆2 so that 𝑆1 = 𝑆2 = . Then 𝐷 𝑆1 =
2
𝐷 𝑆2 = {1, 2}. Now, suppose there is an edge from 𝑣1 (or
𝑣2 or both) to some vertex 𝑣𝑖 in 𝐻1 . Then put 𝑢1 and 𝑢2 in
𝑆1 and 𝑣1 , 𝑣2 and 𝑣𝑖 in 𝑆2 . Distribute the remaining 𝑛2 − 3
𝑛 1 +𝑛 2
vertices in 𝑆1 and 𝑆2 so that 𝑆1 = 𝑆2 = .
2
Then 𝐷 𝑆1 = 𝐷 𝑆2 = {1, 2}.

If 𝑛1 = 𝑛2 = 2, then 𝐺 ∨ 𝐻 will be the complete bipartite

graph 𝐾2,2 which is discussed earlier.

Acknowledgments
The first author thank Kerala State Council for Science,
Technology and Environment for sanctioning major project
(No.005/KSYSA-RG/2014/KSCSTE). The third author
thank University Grants Commission for granting
fellowship under Faculty Development Programme
(F.No.FIP/12th plan/KLMG 045 TF 07 of UGC-SWRO).

References
[1] M.O. Albertson, J. Pach, M.E. Young, “Disjoint
homometric sets in graphs”, Ars Mathematica
Contemporanea, 4(1) (2011), 1 - 4.
[2] T.A. Althuis, F. Gӧbel, “Graph Theoretic aspects of music
theory”, UT publications, University of Twente,
Department of Applied Mathematics, Memoranda 1573,
2001.
[3] M. Axenovich, L. Ozkahya, “On homometric sets in
graphs”, Australasian Journal of Combinatorics, 55 (2013),
175 - 187.
[4] R. Balakrishnan, K. Ranganathan, “A Textbook of Graph
Theory”, Springer, 2000.
[5] D.C. Fisher, P.A. McKenna, E.D. Boyer, “Hamiltonicity,
diameter, domination, packing, and biclique partitions of
Mycielski’s graphs”, Discrete Appl. Math., 84 (1998), 93 -
105.
[6] R. Fulek, S. Mitrović, “Homometric sets in trees” ,
European Journal of Combinatorics, 35 (2014), 256 - 263.
[7] R. Hammack, W. Imrich, S. Klavžar, “Handbook of
Product Graphs”, CRC Press, (2011).
[8] P. Lemke, S.S. Skiena, W.D. Smith, “Reconstructing sets
from interpoint distances”, Discrete and Comput. Geom.,
Algorithms Combin., 25 (2003), 507 - 631.
[9] Marjorie Senechal, “A point set puzzle revisited”,
European Journal of Combinatorics, 29 (2008), 1933-1944.
[10] E. Munarini, A. Scagliola, C. Perelli Cippo, N. Zagaglia
Salvi, “Double Graphs”, Discrete Mathematics, 308 (2008),
242 - 254.
850
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________