Documente Academic
Documente Profesional
Documente Cultură
Types Of Dominations
By
Monisha G
M17MA08
GUIDED BY
DR SUDHA
Introduction
The
following result is observed by
SampathKumar and Walikar.
Theorem 1: If H is a connected spanning
subgraph of G, then (G) (H).
Theorem 2: If G is a connected graph with p3
vertices, (G) = (G).
Theorem 3: For any connected graph G,(G) =
(G).
Observation
:
If G has no isolated vertices,then
It is easy to see that (G) (G)2(G).
For any connected graph G with , (G) (G).
Relationship
between
Relationship between
Observation:
C : Represents changing
U: Represents unchanging
V : Vertex
E: Edge
R: Removal
A : Addition
(G - v) (G) for all vV (CVR)
(G - e) (G) for all eE (CER)
(G + e) (G) for all e E (CEA)
(G - v) = (G) for all vV (UVR)
(G - e) = (G) for all e E (UER)
(G + e) = (G) for all eE(G) (UEA)
It is useful to partition the vertices of G into three
sets according to how their removal affects their γ
(G). Let V = V0 U V+ U V - for
V 0
= {v V : (G - v) = (G)}
V +
= {v V : (G - v) > (G)}
V -
= {v V : (G - v) < (G)}
Similarly, the edge set can be partitioned into
V0 = {uv E : (G - uv) = (G)}
V- = {uv E : (G - uv) < (G)}
V- = {uv E : (G +uv) < (G)}
V0 = {uv E : (G +uv) = (G)}
vertices in V + were characterized by Bauer,
The
For Path , ,
=2
For Path
For Path ,
Cycle
Observation:
For Cycle ,
For Cycle
For Cycle
Conclusion
Relationships among Classes:
There are many interesting
relationships among the six classes of changing and
unchanging graphs with domination parameters.
Reference
B.D. Acharya, The strong domination number of a
graph and related concepts, J. Math.Phys. Sci., 14(5)
(1980), 471–475.
S. Arumugam and R. Kala, Domsaturation number of
a graph, Indian J. pure appl. Math., 33(11)(2002),
1671 - 1676.
S. Arumugam and M. Subramanian, Independence
saturation and extended domination chain in graphs,
AKCE J. Graphs. Combin., 4(2)(2007), 59–69.
S. Arumugam and S. Ramachandran, Invitation
to Graph Theory, Scitech Publications, 2001.
J.R.
Carrington, F. Harary and T.W. Haynes,
Changing and unchanging the domination
number of a graph, J. Combin. Math. Combin.
Comput., 9 (1991), 57–63.
G. Chartrand and L. Lesniak, Graphs and
Digraphs, CRC, Fourth Edition (2005).
E. J. Cockayne, R.M. Dawes and S. T. Hedetniemi,
Total domination in graphs, Networks, 10, 211–
219.
T.W. Haynes, S. T. Hedetniemi and P. J. Slater,
Fundamentals of Domination in Graphs, Marcel
Dekker, Inc., New York, 1998.
T.W. Haynes, S. T. Hedetniemi and P. J. Slater,
Domination in Graphs Advanced Topics, Marcel
Dekker, Inc., New York, 1998.
T.W. Haynes and P.J. Slater, Paired domination
in graphs, Networks, 32 (1998), 199–206.
E.Sampathkumar and H.B. Walikar, The
connected domination number of a graph, J.
Math. Phys. Sci., 13 (1979), 607–613.