Professional Documents
Culture Documents
1. INTRODUCTION
The graph G = (V,E) we mean a
finite, undirected and connected graph with
neither loops nor multiple edges. The order
and size of G are denoted by m and n
respectively. The degree of any vertex u in
for
all
v S and N[s] N (S ) S .
If
u S then
the
private
S V and
neighbour set of u with respect to S is
defined by pn[u, S ] {v : N[v] S {u}}.
H(m1,m2,....mn) denotes the graph obtained
from the graph H by pasting mi edges to
v i V (H ), 1 i n
the
vertex
H(Pm1,Pm2,.......Pmn) is the graph obtained
from the graph H by attaching the end
vertex of Pmi to the vertex vi, in H ,
1 i n . Bistar B(r,s) is a graph obtained
from K1,r and K1,s by joining its centre
vertices by an edge.
In a graph G, a vertex dominates
itself and its neighbours. A subset S of V is
called a dominating set in G if every vertex
in V is dominated by at least one vertex in
40
International Journal of Digital Information and Wireless Communications (IJDIWC) 2(1): 40-45
The Society of Digital Information and Wireless Communications, 2012(ISSN 2225-658X)
2. MAIN RESULTS
41
International Journal of Digital Information and Wireless Communications (IJDIWC) 2(1): 40-45
The Society of Digital Information and Wireless Communications, 2012(ISSN 2225-658X)
International Journal of Digital Information and Wireless Communications (IJDIWC) 2(1): 40-45
The Society of Digital Information and Wireless Communications, 2012(ISSN 2225-658X)
Then n 2 . If n 1 then G is
a complete graph which is a contradiction.
If (G) n 2. Then G is isomorphic to
Kn - Y is a matching in Kn. Then dd(G)=2
or 3 . If dd(G) =2, then n = 4 then G is
either C4 or K4- e. But dd(C4)=3n-2.
Hence G is isomorphic to K4-e. If dd(G) =
3 then n = 5 and hence G is isomorphic to
K5- Y where Y is a matching on K5 with
Y 2.
Then
Then n 3 . If n 1 then G is
a complete graph which is a contradiction.
If n 2 then G is isomorphic to K - Y
n
Subcase 3.2.
V X K1 K 2
is
double
isomorphic to C5.
.
isolated
V X
If
vertex then
contains an
(G) n 4 which is contradiction. Hence
V X is isomorphic to K 2 K 2. Also
every vertex of V X is adjacent to all the
vertices of X. Let x1 x2 , x3 x4 E (G). Then
International Journal of Digital Information and Wireless Communications (IJDIWC) 2(1): 40-45
The Society of Digital Information and Wireless Communications, 2012(ISSN 2225-658X)
Subcase 4.1. V X K 4
Then every vertex of V X
is adjacent to all the vertices in X. Suppose
E X . Then X 4 and hence G is
isomorphic to Ks,4 where s = 1,2,3,4. If s 1
then dd(G)=3 or 4 which is a contradiction
to dd(G) = n. Hence G is isomorphic to
K . Suppose E X . If any one of
1,4
Subcase 4.2. V X P3 K1
Let x1 be the isolated vertex
in V X and (x , x , x ) be a path. Then
2
3
4
x1 is adjacent to all the vertices in X and
x2,x4 are not adjacent to at most one vetex
in X and hence {x1,x2.x4,v1.v2}where
v1 N ( x1 ) X and v 2 N ( x 2 ) X is a
double dominating set of G and hence
dd(G)5. Thus n = 5. Then G is isomorphic
to P5 or C4(1,0,0,0) or K3(1,1,0) or
(K4- e )(1,0,0,0) . All these graph dd(G)n
which is contradiction.
Subcase 4.3. V X K 3 K1
in
{x1,x2,x3,v1,v2}
v1 , v 2 X N ( x 2 x3 ) is
where
a
double
dominating set of G and hence n = 5 . All
these graph dd(G)n.
Subcase 4.4. V X K 2 K 2
Let
x1 x2 E (G) and
Subcase 4.5. V X K 2 K 2
x1 x2 , x3 x4 E (G).
Since
Let
(G) n 4, each x is non adjacent to
i
International Journal of Digital Information and Wireless Communications (IJDIWC) 2(1): 40-45
The Society of Digital Information and Wireless Communications, 2012(ISSN 2225-658X)
3. Conclusion
In this paper we found an
upper bound for the sum of double
domination number and connectivity of
graphs and characterized the corresponding
extremal
graphs.
Similarly
double
domination number with other graph
theoretical parameters can be considered.
REFERENCES
[1] G.Chartrand and
Digraphs, CRC,(2005).
L.Lesniak,Graphs
and
[4]
F.Harary
and
T.W.Haynes,
Double
Domination in graphs, Ars combin. 55, 201213(2000).
[5]
J.Paulraj
Joseph
and
S.Arumugam,
Domination and connectivity in Graphs,
International Journal of management and systems,
8,233- 236(1992).
45