Keywords:-
Article Content:-
Abstract
Let be any connected graph A dominating set D is said to be a complete cototal dominating set if the induced subgraph has no isolated vertices.. A complete cototal dominating set D is said to be degree equitable complete cototal dominating set if for every vertex there exist a vertex such that and provided and contains no isolated vertices. The minimum cardinality of degree equitable complete cototal dominating set is called degree equitable complete cototal domination number of a graph and it is denoted by . In this paper, we have obtained the of some standard class of graphs and further established some bounds forc
References:-
References
B. Basavanagoud and S. M. Hosamani, Connected cototal domination number of a graph, Transactions on Combinatorics, Vol.01,2(2012), pp 17-25.
B. Basavanagoud and S. M. Hosamani, Degree equitable connected domination in graphs, ADMS, Volume 5, Issue 1, 2013, pp 1-11
B. Basavanagoud and S. M. Hosamani, Complete cototal domination number of a graph, J. Sci. Res. 3(3), 547-555 (2011).
E. J. Cockayne and S. T. Hedetniemi, Towards a theory of domination in graphs. Networks 7, 247-261 (1977). http://dx.doi.org/10.1002/net.3230070305
E. J. Cockayne, R. M. Dawes, and S. T. Hedetniemi, Total domination in graphs, Networks 10(3), 211-219(1980). http://dx.doi.org/10.1002/net.3230100304
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, 1969.
T. W. Haynes, S.T. Hedetniemi, and P.J.Slater, Fundamentals of domination in graphs, Marcel Dekker, Inc, New York, 1998.
V. R. Kulli, B. Janakiram and R. R. Iyer, The cototal domination of graph, Discrete Mathematical Sciences and Cryptography 2, 179-184 (1999).
E. Sampathkumar and H. B. Walikar, The connected domination number of graph, J. Math. Phys. Sci. 13, 607(1979).
V. Swaminathan and K. M Dharmalingam, Degree equitable domination on graph, Kragujevac Journal of Mahtematics,1 (35) (2011), s191-197.