Professional Documents
Culture Documents
Graphs and
Combinatorics
Springer-Verlag 2002
1. Introduction
We consider only nite undirected graphs without loops or multiple edges. The
order of graph G V ; E is jV Gj and its size is jEGj. If S V G then hSi
denotes the induced subgraph of G with vertex set S. Two vertices in S are
adjacent in hSi if and only if they are adjacent in G. A vertex with degree one is
called an end-vertex or a pendant vertex. The minimum and maximum degrees of
vertices of G are denoted by d and D respectively. For every vertex v 2 V G the
neighbourhood N1 v is the set of all vertices adjacent to v in G; i.e.,
N1 v fu 2 V G : uv 2 EGg:
The distance du; v between two vertices u and v is the length of a shortest u-v
path in G. If there is no u-v path in G, then du; v 1. For every vertex
v 2 V G, the kth neighbourhood Nk v of v is dened by
Nk v fu 2 V G : du; v k in Gg:
For terminology and notation not given here, the reader is referred to [2] or [5].
The concept of domination was generalized to distance k-domination. Slater
[9] termed a distance k-domination set as a k-basis.
Denition (Slater): Given a nite graph G V ; E, a subset D of the set V of
vertices is called a dominating set when every vertex not in D is adjacent to atleast
668 N. Sridharan et al.
Examples.
1. c2 Kn 1
2. c2 Km;n
1
3. c2 Pn n5 where Pn is the path on n vertices
4. c2 Cn n5 where Cn is a cycle on n vertices
5. If G is the Petersons graph, c2 G 2
We rst observe that c2 G cG and c2 G cG2 where V G2 V G and
u; v 2 V are adjacent in G2 if and only if du; v 2 in G.
2. Results
1, where G
Theorem 1. For any graph G, either c2 G 1 or c2 G is the com-
plement graph of G.
Fig. 1.
Proof. We rst prove this result for a tree. The result is clearly true for a tree
whose order is 3 or 4 or 5. We assume that the result is true for all trees of order
n. Let T be a tree with n+1 vertices. Let P = u0 ; u1 ; u2 ; . . . ; um be the longest
path in T . If m 2 then c2 T 1 bn 1=3c. So assume that m 3. Let T 0 be
the component of T fum ; um1 ; um2 g which contains the vertex u0 . If the order
of T 0 2 then fum2 g is a c2 -set for T . If the order of T 0 3, by induction
c2 T 0 bn 2=3c. Let D0 be a c2 -set for T 0 . Then D0 [ fum2 g is a distance two-
dominating set for T and hence c2 T bn 1=3c. Hence by induction the
result is true for all trees. Let G be any graph in which each component contains at
least three vertices. For each component H of G, c2 H c2 T P bOH =3c,
whenever
P T is a spanning tree in H . Hence c 2 G c2 H
bOH =3c b p=3c.
Now we characterise the graphs for which c2 p=3. For G = C6 , the cycle of
order 6, c2 G 2 p=3.
Proof. Let G be a graph with c2 G p=3. The result is true if G = P3 , the path
on three vertices. So assume that G 6 C3 ; P3 . Let A be a distance two-dominating
set with jAj c2 G p=3 and with the minimum number of components (i.e.,
number of components in hAi is minimum). Then we note the following.
(i) jAj p=3 and so N1 A 6 /
(ii) If a vertex x in A is not adjacent to any vertex of N1 A, then there is
atleast one vertex y in A such that xy is an edge in G and hence A fxg is also a
distance two-dominating set with less than p=3 vertices which is a contradiction.
Therefore every vertex in A is adjacent to atleast one vertex in N1 A
(iii) jN1 Aj p=3. Otherwise by (ii) it follows that N1 A is a distance two-
dominating set with cardinality less than c2 G which is a contradiction.
(iv) We claim that N2 A 6 /. If possible assume that N2 A /. Then every
vertex in A is isolated in hAi [if a vertex x in A is not isolated in hAi, then A fxg is
a distance two-dominating set with p=3 1 vertices as N2 A / which will be a
contradiction]. If there is one y in N1 A which is adjacent to two distinct vertices
x1 and x2 of A, then A [ fyg fx1 ; x2 g is a distance two-dominating set, which is
a contradiction.
Bounds on the Distance Two-Domination Number of a Graph 671
[
m
Q Vai ;
i1
S S
R fW a : a 2 A S2 [ U1 g and T fXaj : aj 2 S2 Qg is a partition of
V V G. Note that jAj = jV \ Aj < 1=3jV j which is a contradiction. Thus
a 2 A S2 ) deg(a) 6 1 in G.
We have already noted that
This is possible only when jS2 j jS1 j jS1 j jN2 Aj. To each ai 2 S2 , select
one yi 2 S1 and zi 2 N2 A such that N zi \ S1 fyi g and N yi \ S2 = fai g. Let
Xai fai ; yi ; zi g 8 ai 2 S2 . If ai 6 aj then Xai \ Xaj /. Now we claim that A =
S2 . If possible assume that S2 A. To each a 2 A S2 let Wa fag [ N a. For
a; b 2 A S2 and a 6 b, Wa \ Wb / (otherwise A fa; bg [ fug is a distance
two-domination set where u 2 Wa \ Wb ). Also for each a in A S2 , N a
N1 A.
Now
! !
[ [ [
V G Xa Wa ;
a2S2 a2AS2
c2 G 1 jM2 Sj jAj
c2 G 1 jM2 Sj jX Sj=2
674 N. Sridharan et al.
c2 G 1 p D 1=3 p D 2=3
i.e., c2 G p D 2=3 < p D 1=2 as D 1 < p:
D 1 < p ) 3D 2D 4 3 < 3p 2p
) 2p 2D 4 < 3p 3D 3 ) p D 2=3 < p D 1=2
Therefore
c2 G 1 jM2 S2 j jAj
1 jM2 S2 j l=3
1 l=3 p D 1 l=2 jM2 S2 j M1 S2 S2 =2
p D 1=2 1 l=2 l=3
p D 1=2 6 l=6 p D 1=2 as l 6
c2 G 1 jM2 S2 j 1
2 jM2 S2 j
2 jM1 S2 j jS2 j=2
2 p D 1 l=2
p D 1 4 l=2
p D=2 as 3 l 5
References
1. Acharaya, B.D., Walikar, H.B., Sampathkumar, E.: Recent development in the theory
of domination in graphs. Metha Research Institute, Allahabad MRI Lect. Notes Math.
1979
2. Bondy, J.A., Murty, U.S.R.: Graph Theory and Applications. New York: North Holland
1986
3. Cockyane, E.J., Hedetniemi, S.T.: Towards a theory of dominations in graphs. Net-
works 7, 243261 (1977)
4. Cockyane, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks
10, 211219 (1980)
5. Harary, F.: Graph Theory. Reading: Addison-Wesley 1969
6. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs.
New York: Marcel Dekkar 1998
7. Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Domination in Graphs: Advanced
Topics. New York: Marcel Dekkar 1998
8. Mc Cuaig, W., Shepherd, B.: Domination in graphs with minimum degree two.
J. Graph Theory 13, 749762 (1989)
9. Slater, P.J.: R-dominations in graphs. J. Assoc. Comput. Macg. 23, 446460 (1976)