Hop Domination in Graphs-II

References

[1] S.K. Ayyaswamy and C. Natarajan, Hop domination in graphs, submitted to Discussiones Mathematicae Graph Theory.
Search in Google Scholar Back to article
[2] G. Chartrand and L. Lesniak, Graphs and Digraphs, Chapman and Hall, CRC, 4th edition, 2005.
Search in Google Scholar Back to article
[3] M. Chellali, O. Favaron, A. Hansberg and L. Volkmann, k-domination and k-independence in graphs: A survey, Graphs and Combinatorics, 2012.10.1007/s00373-011-1040-3
Search in Google Scholar Back to article
[4] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in graphs, Marcel Dekker, New York, 1998.
Search in Google Scholar Back to article
[5] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in Graphs - Advanced Topics, Marcel Dekker Inc., 1998.10.1002/(SICI)1097-0037(199810)32:3<;199::AID-NET4>3.0.CO;2-F
Search in Google Scholar Back to article
[6] T.W. Haynes, M.A. Henning and P.J. Slater, Strong equality of domination parameters in trees, Discrete Mathematics, 260:77-87,2003.10.1016/S0012-365X(02)00451-X
Search in Google Scholar Back to article
[7] J.R. Lewis, Vertex-edge and Edge-vertex paramaters in graphs, PhD The- sis, Graduate School of Clemson University, August 2007.
Search in Google Scholar Back to article
[8] N. Sridharan, V.S.A. Subramanian and M.D. Elias, Bounds on the dis- tance two-domination number of a graph, Graphs and Combinatorics, 18:667-675, 2002.10.1007/s003730200050
Search in Google Scholar Back to article