(IJCNS) International Journal of Computer and Network Security, 45
Vol. 2, No. 4, April 2010
Powers of a Graph and Associated Graph
Labeling
G. N. Purohit, Seema Verma and Usha Sharma
Centre for Mathematical Sciences,
Banasthali University, Rajasthan 304022
usha.sharma94@yahoo.com
Abstract: - Graph coloring is a classical topic in graph theory
and vertex coloring of a graph is closely associated with channel
assignment in wireless (sensor) network. Unit Disk graph is a
suitable model for connectivity in sensor network. This paper is
concerned with the power of a graph in general and power of
Unit Disk graph in particular. L(1,1,1)- Labeling is used to
avoid interference between communicating channels. We
develop L(1,1,1)-Labeling of a UD graph. For this we make use
of cellular partition algorithm. We have proved that cube of any
UD graph can be properly colored by at most 25ω colors, where
ω is the maximum clique size.
Keywords: Graph Labeling, wireless network.
1. Introduction
A graph G = (V, E), where V is the set of vertices and E is
the set of edges. Each edge i.e. element of E is an unordered
pair of element of V. Out of many induced graphs from a
graph; power graph finds a special place. Powers of a graph
have been considered in [1]. Square of a graph is a graph
with the same vertex set in which vertices at distance 2 are
connected through an edge. Cube of a graph is also the
graph on the same set of vertices; however, additionally
there is an edge between two vertices whenever they are at
most distance 3.
Graph coloring is a classical problem in graph theory and
proper coloring of a graph means assigning distinct colors
(labels) to adjacent vertices. The minimum number of colors
required to color a graph G properly is called chromatic
number of G and denoted as χ (G). A lot of research has
been done on the chromatic number of graphs. χ is bounded
by ω ≤ χ ≤ ∆+1 [5], where ω is the maximum clique size in
the graph and ∆ is the maximum degree of graph. The
chromatic number of powers of a graph has been studied in
[1].
Besides proper coloring there are many types of coloring
(labeling) of vertices. One such generalization is L(p,q)-
labeling, in which the labels at adjacent vertices should
differ by atleast p and labels at vertices at distance 2 should
differ by atleast q [6]. L(p,q)- labeling problem has attracted
attention of many researchers in the past [7]. Particular
cases of L(p,q)- labeling (i) L(1,1)- labeling and (ii) L(2,1)-
labeling have been defined and a lot of research has been
done in this area. L(1,1)- labeling is also known as distance
two coloring problem and is equivalent to the proper
coloring of the square of a graph, [11] includes labeling of
many important graphs. Another generalization of labeling
(coloring) is L(h,1,1)- labeling, in which the labels on
adjacent vertices differ by atleast h and labels on vertices at
distance 2 or 3 are distinct [10]. This concept is applied in
channel assignment problem and in wireless (sensor)
network.
Unit Disk graph [8] is another class of a graph, which finds
application in modeling a wireless (sensor) network. Since
the radio coverage range of sensors is based on Euclidean
distance between the nodes. So we utilize the concept of
Euclidean distance in a graph. This concept of Euclidean
distance in a graph has given rise to a new branch termed as
geometric graph theory. One can extend the concept of
power of graphs to the UD graph to obtain square and cube
of graphs and also Euclidean distance two graph [8] and
Euclidean distance three graph. Chromatic number of UD
graph and square of UD graph is considered in [8]. These
results are useful in the wireless sensor network technology.
In this paper we describe some powers of a graph and
powers of a unit disk graph. We develop a L(1,1,1)- labeling
of a UD graph by using cellular partition algorithm.
This paper is organized as follows. In Section-2 we have
provided some auxiliary definitions. In particular we have
obtained some results related to powers of a cycle and a
complete bipartite graph. In Section-3 we have defined Unit
Disk graph and its powers. Some results have been proved
for powers of a UD graph. In Section-4 we have given
cellular partition algorithm [8]. The main result of the paper
is theorem (4.1). This theorem shows that using the
developed cellular partition algorithm, cube of any UD
graph can be properly colored using 25ω colors, where ω is
the maximum clique size. In last Section, we have given
conclusion.
2. Auxiliary Definitions
2.1 Graph Powers
In this section we consider different powers of graph, which
finds application in channel assignments, L(p, q)- coloring
of graphs etc.
2.1.1 Square of a graph (G2) - The Square G2 of a graph G
= (V, E) is the graph, whose vertex set is V itself and there
46
is an edge between two vertices vi and vj if and only if their
graph distance (length of shortest path between vi and vj) in
G is at most 2. Examples of a graph and its square graphs
are given in following figures:
Figure 1. (a) Cycle C6 Figure 1.(b) Square of Cycle C6
2.1.2 Cube of a graph (G3) - The Cube G3 of a graph G (V,
E) is the graph, whose vertex set is V and there is an edge
between two vertices vi and vj if and only if their graph
distance in G at most 3. Examples of a graph and its cube
graphs are given in following figures:
Figure 2. (a) Cycle C6 Figure 2. (b) Cube of Cycle C6
We can generalize the above definitions as follows:-
2.1.3 Kth power of a graph (Gk) - The kth power Gk of a
graph G (V, E) is the graph, whose vertex set is V and there
is an edge between two vertices vi and vj if and only if their
graph distance in G is at most k.
As a special case we prove the following results for cycle Cn
and complete bipartite graph Km,n.
Theorem 2.1 If G = Cycle with n vertices (Cn), Then
Proof: Case (i): Let G = Cn (4≤n≤2k) and let vi and vj be
any two arbitrary vertices of G. The maximum distance
between vi and vj could be k in this case and thus any pair of
vertices could have a graph distance at most k.
Thus max {d (vi, vj)│ ∀ vi, vj є V}≤k.
From the definition of Gk, two vertices will be adjacent if d
(vi, vj) ≤ k. Since this condition is satisfied by all pairs of
vertices in G. Therefore all pairs of vertices will be adjacent
in Gk and hence Gk will be a complete graph on n vertices
and thus (C n)k =Kn.
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 4, April 2010
Case (ii): Let G = Cn (n≥2k+1) and let vi be an arbitrary
vertex of graph G. We have to show that deg (vi) = 2k ∀ vi є
C n. We know that deg (vi) = 2, ∀ vi є C n. From the
definition of Gk, two vertices will be adjacent if the distance
between them is at most k.
There are exactly 2k vertices which are at most at a distance
k from vi. On one side of vi these k vertices vi+1, vi+2,
vi+3………. vi+k are at distance 1, 2, 3…….k from vi
respectively. Similarly on the other side of vi these k vertices
vi-1, vi-2, vi-3………. vi-k are at distance 1, 2, 3…….k from vi
respectively. Out of these 2k vertices vi+1 and vi-1 are already
adjacent to vi in Cn and remaining 2k-2 vertices will be
made adjacent to vi in (Cn) k. Therefore deg (vi) = 2+2k-2 =
2k. Thus (Cn) k will be a 2k-Regular graph on n vertices.
Theorem 2.2 If G = Km,n, then
Gk = Gk-1= Gk-2 =……………= G3 = G2 = Km+n.
Proof: Let G = Km,n be a bipartite graph. Let V1 and V2 be
two partitions of vertex set V of G with m and n number of
vertices respectively. Let vi be an arbitrary vertex of V1.
Then all the vertices of V2 are at distance 1 from vi.
Moreover all other vertices of V1 are at distance 2 from vi.
Since vi is an arbitrary vertex therefore this is true for all vi’s
in V1 as well as for all vertices in V2. Thus all the pairs of
vertices are adjacent in G2. Thus G2 will be a complete
graph on m+n vertices. Gk (k>2) will not change Km+n.
Thus Gk = Gk-1= Gk-2 =……………= G3 = G2 = Km+n.
2.2 Labeling of a graph G (V, E)
2.2.1 L (p, q) – Labeling - For two positive integers p and
q, an L(p,q)- Labeling of a graph G is a function
C:V(G) → N such that C(vi) - C(vj) ≥ p if vertex vi and
vj are adjacent and C(vi) - C(vj) ≥ q if vertex vi and vj
are at distance 2.
In particular L(1, 1)- labeling and L(2,1)- labeling are well
known examples of L(p,q)- Labeling.
2.2.2 L (1,1) – Labeling - It is also called the proper
labeling of a graph G. It is the labeling of the vertices with
non negative integers such that the labels on adjacent
vertices differ by at least 1.
2.2.3 L (2,1) – Labeling - It is a labeling of the vertices
with non negative integers such that the labels on adjacent
vertices differ by at least 2 and the labels on vertices at
distance 2 differ by at least 1.
We can generalize the above definition as follows:-
2.2.4 L (p,q,r) – Labeling - For three positive integers p, q
and r, an L(p,q, r)- Labeling of a graph G is a function
 (IJCNS) International Journal of Computer and Network Security, 47
Vol. 2, No. 4, April 2010

C:V(G) → N such that C(vi) - C(vj) ≥ p if vertex vi and 3.5 Euclidean distance three graph of a Unit Disk graph
(GUDED3) - Euclidean distance three graph of a unit disk
vj are adjacent, C(vi) - C(vj) ≥ q if vertex vi and vj are at graph GUD (V, E) is the graph whose vertex set is V and
there is an edge between two vertices vi and vj if and only if
distance 2 and C(vi) - C(vj) ≥ r if vertex vi and vj are at their Euclidean distance in GUD is at most 3.
distance 3.
In particular L(1,1,1)- Labeling is more useful in channel
assignment problem and in wireless (sensor) network than
the others.

2.2.5 L (1,1,1) – Labeling - It is the labeling of the vertices

with non-negative integers such that the labels on adjacent
vertices, on vertices at distance 2 and 3 are different.

We can generalize it as follows:-

2.2.6 L (d1,d2,d3,…..di,…..dk) – Labeling:- It is a labeling

of the vertices with non-negative integers such that the
labels on vertices at distance i from each other differ at least
by di.

3. Powers of a Unit Disk graph 4(a)

For the sake of completeness, we first define unit disk

graph.

3.1 Unit Disk Graph- A graph G is a Unit Disk graph if

there is an assignment of unit disks centered at its vertices
such two vertices are adjacent if and only if one vertex is
within the unit disk centered at the other vertex. We denote
a unit disk graph by GUD.

3.2 Square of a Unit Disk Graph (GUD2) - The Square

GUD2 of a Unit Disk graph GUD (V, E) is the graph whose
vertex set is V and there is an edge between two vertices vi
and vj if and only if their graph distance in GUD is at most
2.
4(b)
3.3 Euclidean distance two graph of a Unit Disk graph
(GUDED2) - Euclidean distance two graph of a unit disk Figure 4. (a): Cube of a UD graph (GUD3)
graph GUD (V, E) is the graph whose vertex set is V and Figure 4. (b): ED-3 graph of a UD graph (GUDED3)
there is an edge between two vertices vi and vj if and only if
their Euclidean distance in GUD is at most 2. Now we discuss some results relating to GUD and GUDED.

Theorem 3.1 For any Unit disk graph GUD, GUD2 ⊆ GUDED2.

Proof: The proof of this theorem is given in [8].

Theorem 3.2 For any Unit disk graph GUD, GUD3 ⊆ GUDED3.

Proof: Let GUD be a Unit Disk graph. GUD3 be the cube of

GUD and GUDED3 be the Euclidean distance three graph of
Figure 3. (a): Figure 3. (b): ED-2
GUD. Since both the graph are on the same vertex set. So it
Square of a UD graph of a UD graph
is sufficient to prove this theorem that edge set of GUD3 is the
graph
subset of edge set of GUDED3. Let (c, w) be an edge in GUD3.
There must exist two vertices u & v such that (c, u), (u, v),
3.4 Cube of a Unit Disk graph (GUD3) - The cube GUD3 of a (v, w) are three edges in GUD. Since GUD is a Unit Disk
Unit Disk graph GUD (V, E) is the graph whose vertex set is graph.
V and there is an edge between two vertices vi and vj if and
only if their graph distance in GUD is at most 3.
48
If we consider dEd(c, w) denotes the Euclidean distance
between c and w, then
dED(c, w) ≤ dED(c, v) + dED (v, w)
≤dED(c, u) + dED (u, v) + dED (v, w)
= 1+1+1 = 3.
Hence dED (c, w) ≤ 3. Thus the edge (c, w) is an edge in
GUDED3.
Hence GUD3 ⊆ GUDED3
Further GUD3 may be proper subgraph of GUDED3 in some
instances. We will show that there might be an edge in
GUDED3 but not in GUD3. As shown in figure 4(b), there might
be a vertex x in GUDED3 such that 1<dED(c, x) ≤ 3 and but
there are no two vertices u' and v' such that (c, u'), (u', v')
and (v', x) are edges in GUD. Thus (c, x) is an edge in GUDED3
but not in GUD3. Similarly there might be a vertex y in
GUDED3 such that 1<dED(c, y) ≤ 2 but there are no vertex w'
such that (c, w') and (w', y) are edges in GUD. Thus (c, y) is
an edge in GUDED3 but not in GUD3.
Theorem 3.3 For any UD graph GUD, a coloring scheme χ
(GUDED3) for coloring GUDED3 would also color GUD3 which is
equivalent to L(1,1,1)- labeling of GUD.
Proof: Since we’ve proved in previous theorem, any GUD3 be
a subgraph of GUDED3 then ∃ a coloring scheme χ (GUDED3)
to color GUDED3 properly could be sufficient to any of its
subgraph. Therefore it would also color GUD3. Since L(1,1,1)
labeling of GUD is equivalent to proper coloring of GUD3.
Thus χ (GUDED3) fulfill L(1,1,1) labeling of GUD.
4. Cellular Partition Algorithm
The concept of UD graph as well as labeling can be applied
in wireless sensor networks since we can model a wireless
sensor network as a UD graph. In this modeling sensors are
denoted as vertices. The sensing coverage area of a sensor is
represented by a unit disk centered at the corresponding
vertex. The connectivity between two sensors is determined
as if one sensor is within the sensing coverage area of
another sensor. If GUD represent a model of a wireless sensor
network, then GUD2 and GUD3 provide possible interfering
sensor nodes. To avoid this interference we need a proper
labeling for GUD3 which is equivalent to L(1, 1, 1)- Labeling
of GUD.
In order to cover the targeted area by sensors, we have to
divide the whole area in smaller cells (area). We have
chosen regular hexagons to cover the whole plane based on
the observation that hexagon is the most suitable polygon
which could cover the plane efficiently. It is the most
suitable tile that could cover the plane with no overlap and
thus it is the most efficient way to cover the plane.
Now in order to label the nodes we adopt the Cellular
Partition algorithm. In this algorithm first of all we partition
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 4, April 2010
the whole plane in unit hexagonal cells with a side length ½
thus the diagonal length of each cell is 1. If there is any UD
graph in this plane, vertices of the graph inside the cell will
form a clique, since no two vertices in the same hexagon
have a Euclidean distance greater than 1. Let the maximum
clique size be ω then there can not be more than ω vertices
in the same hexagonal cell. Since we know that ω colors are
sufficient to color each hexagonal cell. Therefore we can
color the whole graph properly.
Using the above Cellular Partition algorithm we prove the
following theorem:
Theorem 4.1 Euclidean distance three graph GUDED3 for any
UD graph GUD can be properly colored by at the most 25ω
colors where ω is the maximum clique size.
Proof: We partition the whole plane into hexagonal cells
with side ½ and diagonal 1. All vertices included in any
hexagon would form a clique. Since ω is the maximum
clique size, so we could place at most ω vertices into each
cell.
Next we construct a patch of 25 hexagons* and use 25ω
color to color the patch. An example of the patch is shown
in figure [5] and keeps the same orientation of patches of 25
to cover the whole plane as shown in figure [6]. Now we
prove that a vertex in ith hexagon in a patch would be at a
Euclidean distance of at least 3 to any other vertex in the ith
hexagon in any other adjacent patch.
Figure 5. A patch of 25 hexagons
We maintain the same numbering orientation in a patch for
all patches in the whole plane. So the distance between two
vertices in ith hexagons in adjacent patches is constant. As
an example let A, B and C be the centers of centre hexagons
in the three adjacent patches as shown in figure [6]. Their
distance can be computed as:
We know that AB = 10* 3 /4 = 4.33 > 4.
Also we have AD = ½ + ½ + 1+ ½ + 1+ ¼
= 15/4
 (IJCNS) International Journal of Computer and Network Security, 49
Vol. 2, No. 4, April 2010

References

[1] N. Alon and B. Mohar, “The chromatic number of graph

powers”, Comb. Probab. Comput. 11, 1 (2002), 1–10.
[2] G. J. Chang and D. Kuo, “The l(2,1)-labeling problem
on graphs”, SIAM J. Discret. Math. 9, 2 (1996), 309–
316.
[3] B. N. Clark, C. J. Colbourn and D. S. Johnson, “Unit
disk graphs”, Discrete Math. 86, 1-3 (1990), 165–177.
[4] A. Graf, M. Stumpf and G.Weisenfels, “On coloring
unit disk graphs”, Algorithmica 20, 3 (1998), 277–293.
[5] D. B. West, “Introduction to Graph Theory”, Second
edition Prentice Hall, 2001.
Figure 6. Cover the whole plane with the patches of 25 [6] B. M. K. Q. Peter Bella, Daniel Kral, “Labeling planar
hexagons graphs with a condition at distance two,” in
Proceedings 2005 European Conference on
CD = 5* 3 /4 Combinatorics, Graph Theory and Applications, 2005.
AD2 + CD2 = AC2 [7] M. Hall d´orsson, “Approximating the l(h, k)-labelling
problem,” Engineering Research Institute, University of
2 Iceland Technical, Tech. Rep. Report No. VHI 03-2005,
Therefore AC =  15 
2
 5* 3  = 4.33 > 4. Since the
  +  

Available: citeseer.ist.psu.edu/252952.html
 4   4  [8] T. Ren, K. L. Bryan, and L. Thoma, “On coloring the
vertices in both the hexagons are at distance ½ only from square of unit disk graph,” University of Rhode Island
their centers A, B and C then the distance from any vertex Dept. of Computer Science and Statistics, Tech. Rep.,
in hexagon with center A to any vertex in hexagon with 2006.
center B will be greater than 3. Similarly the distance from [9] Kevin L. Bryan, Tiegeng Ren, Lisa DiPippo, Timothy
any vertex in hexagon with center A to any vertex in Henry, Victor Fay-Wolfe, “Towards Optimal TDMA
hexagon with center C will also be greater than 3. Therefore Frame Size in Wireless Sensor Networks”, University of
our patch fulfills the coloring of GUDED3. Rhode Island Dept. of Computer Science and Statistics,
Tech. Rep.
In the above coloring scheme each hexagon with a certain
[10] T. Calamoneri, E.G. Fusco, R.B. Tan and P. Vocca, “L
color pattern is far away from its sibling hexagon with same
(h,1,1)- labeling of outerplanar graphs”, Mathematical
color pattern. So it is a valid coloring for GUDED3. We can
Methods of Operations research, Volume 69, Number 2,
properly color any GUDED3 graph with 25ω colors. Using
May 2009, 307-312.
Theorem 3.2, it follows that it is valid color scheme for GUD3
also. [11] T. Calamoneri, “The L(h, k)-Labelling Problem: A
Survey and Annotated Bibliography”, The Computer
5. Conclusion Journal Vol. 49 No. 5, 2006.

Using the developed cellular partition algorithm, cube of

any UD graph can be properly colored using 25ω colors,
where ω is the maximum clique size. This is equivalent to
L(1,1,1)- labeling of unit disk graph and can be used to
avoid interference between communicating channels in
wireless (sensor) network. The number 25ω is the upper
bound and we are looking for obtaining a suitable lower
bound also.

Acknowledgement

Ms USHA SHARMA, one of the authors of this paper

acknowledges the grant received from Department of
Science & Technology (D.S.T.), Government of India, New
Delhi for carrying out this research.