0% found this document useful (0 votes)
51 views6 pagesThe Total Global Domination Number of A Graph
Uploaded by
Rosyid Asy-syifaCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
51 views6 pagesThe Total Global Domination Number of A Graph
Uploaded by
Rosyid Asy-syifaCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 6
Indian J. pure appl. Math., 21(6) : $37-542, June 1996
THE TOTAL GLOBAL DOMINATION NUMBER
OF A GRAPH
V. R. KULLI AND B. JANAKIRAM
Department of Mathematics, Gulbarga University, Gulbarga 585. 106
(Received 22 December 1994; after revision 4 January 1996;
accepted 10 January 1996)
A total dominating set T of a graph G = (V. E) isa total global dominating. set
(Lg. set) if Tis also total dominating set of G. The total global domination
number Yig(G) of G is the minimum cardinality of a tga. set. In this paper, we
characterize tg.d. sets and bounds are obtained for Yip (G). We exhibit inequalities
involving variations on domination numbers and vertex covering number. For graphs
with diameter at least five. three of the four domination numbers considered turn out
to be identical. Values are given for paths, cycles and complete bipartite graphs. We
characterize graphs with | V | vertices in any minimum total global dominating set
1. INTRODUCTION
The graphs G considered here have order p and size q (ie. p vertices and q
edges) and both G and their complements G have no isolates. Any undefined term
in this paper may be found in Harary?.
A set. D of vertices in a graph G = (V, E) is a dominating set of G if every
vertex in V — D is adjacent to some vertex in D. The domination number y(G) of
G is the minimum cardinality of a dominating set (see Cockayne and Hedetniemi),
A total dominating set T of G is a dominating set such that the induced subgraph
(T) has no isolates. The total domination number y,(G) of G is the minimum
ity of a total dominating set. This concept was introduced in Cockayne
cardin
et al),
A dominating set D of G is a global dominating set (g.d. set) if D is also a
dominating set of G. The global domination number y,(G) of G is the minimum
cardinality of a g.d. set (Sampathkumar®). The purpose of this paper is to study the
global aspect of total domination.
A total dominating set T of G is a total global dominating set (tg.d. set) if T
is also a total dominating set of G. The total global domination number yy. (G) of
G is the minimum cardinality of a tg.d. set.
We note that y(G) and ¥,(G) are defined for any G while y,(G) is only defined 538 V. R. KULLI AND B. JANAKIRAM.
for G with (G)21 and y_(G) is only defined for G with 8(G)21 and 6G) = 1,
where 6(G) is the minimum degree of G.
A yset is a minimum total dominating set. Similarly a yg-set and a y-set are
defined.
2. RESULTS
Theorem 1 — A total dominating set T of G is a t set if and only if for
each vertex v€ V there exists a vertex u€T such that v is not adjacent to uw.
Theorem 2 — Let G be a graph such that neither G nor G have an isolated
vertex. Then,
Ye (G)=Y— Os A)
Gi) WG) 5% (Gs Q)
(i) yO s%4 GB)
(i) UO+4 G2 sre OsuG+nO. &
Next we characterize graphs G which have total global domination number equal
to the order p of G.
Theorem 3 — Let G be a graph such that neither G nor G have an isolated
vertex, Then,
ig (@) =P -- ()
if and only if G = P, (a path on 4 vertices) or mK; or mKy; m= 2.
PROOF : Suppose (5) holds. On the contrary, suppose G # P,, mK, mK»; m 2 2.
Then we consider the following cases :
Case 1 : If A(G) and AG) are sp—3, where AGG) is the maximum degree of
G, then both G and G have no vertices of degree 1 and hence for any vertex
vEV,V—{v} is a tg.d. set of G, a contradiction.
Case 2: If either A(G) or A(G) = p - 2 say AG) = p - 2 and w is a vertex
‘of degree p — 2, then there exists exactly one vertex v such that v is not adjacent
to u. If v is also of degree p ~ 2, then, as G = mKy; mz2, there exists a vertex
w such that w is not adjacent to at least two vertices. If some non-neighbour x of
w has degree p - 2, then V - x is a t.g.d. set. Otherwise each non-neighbour of w
has at least two non-neighbours and V — w is a tg.d. set. Suppose deg, (v) < p—2.
If w has no neighbour of degree 1, then V ~ u is a tg.d. set of G, otherwise let u
be adjacent to w, degg(w) = 1, and let x be adjacent to v (and necessarily adjacent
to uw and non-adjacent to w) then {v, x, u, w} is a tg.d. set (and G = P,). If AG)
= p — 2, then we can apply the same argument to G (and obtain that G = P,, so
that G = Py = Py).
This proves the necessity. Sufficiency is obvious.
Theorem 4 — Let G be a graph such that neither G nor G have an isolated
vertex and T bea y-set of G with each x in T has non-neighbour in 7. If there THE TOTAL GLOBAL DOMINATION NUMBER OF A GRAPH 539
exists a vertex u@V-T which is adjacent only to vertices in T, then,
Yig (G) 5 ¥1(G) + 2. -~©
PROOF : We consider the following cases :
Case 1 : If V — T = {u}, then there exists a vertex v€T such that v is not
adjacent to u and hence 7 is a t.g.d. set. Thus (6) holds.
Case 2: If V- T * {u}, then there exists a vertex v€V-T and hence TU
{u, v} is a tg.d. set. Thus (6) follows.
Now we obtain a lower bound on Yjp(G).
Theorem 5 — Let G be a graph such that neither G nor G have an isolated
vertex. Then,
2q — p (P ~ 3) $Y (G). oo (M
PROGF : Let T be a Y-set of G. Then by Theorem 1, cach vertex vEV is not
adjacent to at least one vertex in 7. This implies
a2( )-v-nielh,
Thus (7) follows.
In a graph G, a vertex and an edge incident with it are said to cover each other.
The vertex covering number ag(G) equals the minimum number of vertices in a set
S which covers every edge of G.
Theorem 6 — Let G be a graph such that neither G nor G have an isolated
vertex. Then,
Yeg (G) = 209 (G). -- (8)
PROOF : Let S be a vertex cover of G with |S|=o9(G). Let S =
{uyy uz, .. us}, S = {a} is impossible since u has a non-neighbour x, and x has a
neighbour which can only be u;, so s22. Each u€S has a neighbour, a
non-neighbour, or both, in S - u. If u has no neighbour in S, then choose
vEV-S a neighbour of u. If uv has no non-neighbour in S, then choose in V- S
a non-neighbour v of u.
Thus construct D = {v, V2... ¥y}, 5’ <5, not all vertices vi, v; need be distinct,
so| D| s|S|. lf D = {v4} and if v, is adjacent to each vertex of S then add a
non-neighbour v; to D so that | D | =2.
SUD is a tg. set in G because x V- {SUD} has at least one neighbour
which necessarily belongs to S$ and each vertex of D is a non-neighbour of x.
x€S has by construction both a neighbour and a non-neighbour in SD. x€D
has a neighbour in S and as [D|22, x has a non-neighbour in D. Thus
Ya (G) =|S UD|=|5]+|D]s2|5|=209(G). 540 V. R. KULLI AND B. JANAKIRAM
For a vertex vEV, the eccentricity is defined as ev) = max {d(u, vu EV}.
The maximum of the eccentricities is defined to be the diameter of G, denoted diam
@.
Theorem 7 — Let G be a graph with diam(G)25. Then TCV is a total
dominating set of G if and only if T is a tg.d. set.
PROOF : Suppose T is a total dominating set of G. Let u, v@V such that
d(u, v) 25. Then T (\N(u)=o and T (Nv) #o. Let wu ETC) Nu) and v,E
TO Nv). Then u; and v; are not adjacent and further every vertex in V - {u,v}
is adjacent to at most one of u, and yy. This implies that {u, v;} is a total dominating
set of G and hence T is a t.g.d. set.
The converse is obvious.
For a set DCV, the minimum degree of the induced subgraph (D) is denoted
by 8(D)).
Theorem 8 — Let G be a graph such that neither G nor G have an isolated
vertex and diam (G) 25. A set DCV with 8((D)) 21, is a gd. set of G if and
only if D is a tgd. set.
PROOF : Let D be a g.d. set of G. Suppose there exists a vertex u@D such
that u is adjacent to every vertex in D. Then, diam(G) <4, a contradiction. This
implies that D is a total dominating set of G. Since (D) has no isolates, D is a
tg.d. set.
The converse is immediate.
Corollary 8.1 — Let G be a graph such that neither G nor G have an isolated
vertex and D be a y,-set of G with 8((D)) 21. If diam (G) 25, then,
YG) = Viel) - 9)
YelG) = Yig(G). -- (10)
Proposition A (Kulli and Patwari‘) — (i) For any complete bipartite graph
Kpn With 25msn, ¥;(Kp.n) = 2.
(ii) For any cycle C, wit
pe vertices,
(Cp) =(p/2) + 1 if p=2 (mod 4);
= [ p/2] otherwise;
where [x] is a least integer not less than x.
(iii) For any path P, with p24 vertices,
¥(P,) = (p/2) +1 if pm2 (mod 4);
= [ p/2] otherwise.
Now we list the exact values of 7 (G) for some standard graphs.
Proposition 9 — (i) For any complete bipartite graph K,,, with 2< msn, THE TOTAL GLOBAL DOMINATION NUMBER OF A GRAPH S41
Yog (Kmn.n) = 4. w (1)
(ii) For any cycle C, with p24 vertices,
Yu(Cp) = (p/2) +1 if p= 2 (mod 4); ww (12)
= [ p/2] otherwise. w= (13)
(iii) For any path P, with p24 vertices,
og (Pp) = (p/2) +1 if p= 2 (mod 4); w= (04)
= [p/2}. wa» (15)
Theorem 10 — Let diam (G) = k.
@) If k = 4, then y(G)s7,(G)+1. a (16)
Gi) If k = 3, then, (6) holds.
PROOF : Let T be a y,set of G. Suppose k = 4 and u, v be two vertices with
d(u, v) = 4. Then T() N [u} # >. Let u ET Nu]. Then no vertex in G is adjacent
to both u, and v and hence {u,v} is a total dominating set of G. Thus TU {v}
is a tg.d. set. Hence (16) holds.
If k = 3 and w, v be two vertices with d(u, v) = 3, then no vertex in G is
adjacent to both u and v and hence {u, v} is a total dominating set of G. Thus
TU {u, v} is a tg.d. set. Hence (6) holds.
Similarly, we can prove
Theorem 11 — Let D be a ygset of G such that (D) has no isolates and diam
(=k.
(If k= 4, then, yg (G)s¥(G) + 1. w (17)
(i) If k = 3, then, Yq (G) 74 (G) + 2. w (18)
‘When diam(G) = 2, then the difference between y,,(G) and y,(G) as well as between
Yq (G) and y,(G) may be very large. For example, let G = C, with pz 19 vertices.
Then any two vertices u and v at a distance at least four in C, form a y,set for G
and hence y(G) = 2. Also, by (1), (12) and (13), ¥q(G)= Yq (C,)=[ p/2 ]. Further,
yG) = ¥(C,) = [p/3 1.
Theorem 12 — Let diam (G)-and diam (G) = 3.
If G is connected, then
Yq (G)smin {p-A(G)+2, 8G) +4}. ~ (19)
If G is disconnected, then
Yg (G) smin {p-A(G) +3, B(G) +3}. w= (20)
PRooF : By (9) and Theorem 10, 542 V. R. KULLI AND B. JANAKIRAM
Yu (G) 1%, (G) + 2.
Ye @ sy @ + 2.
Since Ye (G) = %5@),
Ye (G) s min {y,(G)+2, 4G) + 2}.
Suppose G is connected. Since A(G)
