### Secure Support Strong Domination in Graphs

#### Abstract

#### Keywords

#### Full Text:

PDF#### References

E. Sampathkumar and L. Pushpa Latha, Strong weak domination and domination balance in a graph, Discrete Mathematics 161 (1996), 235 – 242

R.M. Gera, On Dominator colorings in Graphs, Graph Theory Notes, New York, 52 (2007), 25 – 30.

P.J.P. Gobler and C.M. Mynhardt, Secure domination critical graphs, Discrete Mathematics 309 (2009), 5820 – 5827.

F. Harary, Graph Theory, Addison - Wesley, Reading Mass. (1972).

T.W. Haynes, S.T. Hedetneimi 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).

S.T. Hedetniemi and S.M. Hedetniemi, Dominating partitions of graphs, Technical Report (1979), unpublished manuscript.

H.B. Merouane and M. Chellali, On secure domination in graphs, Information Processing Letters 115 (2015), 786 – 790.

C.Y. Ponnappan, Studies in Graph Theory Support Strong Domination in Graphs, Ph.D thesis, Madurai Kamaraj University (2008).

V. Swaminathan, R. Sundareswaran, Color class domination in graphs, Mathematical and Experimental Physics, Narosa Publishing House (2010).

DOI: http://dx.doi.org/10.26713%2Fjims.v9i3.759

eISSN 0975-5748; pISSN 0974-875X