(1, 2) - Domination in Some Harmonius Graphs

Authors

  • N. Murugesan

  • Deepa.S Nair

dominating set, domination number, (1, 2) - dominating set, 2) - domination number

Abstract

In this paper we discuss (1, 2) -domination in some harmonious graphs namely ladder graph, wheel graph and tetrahedral graph.

How to Cite

(1, 2) - Domination in Some Harmonius Graphs. (2013). Global Journal of Science Frontier Research, 13(8), 65-74. https://journalofscience.org/index.php/GJSFR/article/view/

References

Robert Allan, Renu Laskar (1978) On domination and independent domination numbers of a graph. 23(2), 73-76. https://doi.org/10.1016/0012-365x(78)90105-x

Cockayne E.J., S. Hedetneimi Towards a theory of domination in graphs.

Frank Harary (1969) GRAPH THEORY.

Haynes T.W., Hedetniemi S.T., Slater P.J. (1998) Fundamentals of domination in Graphs.

N. Murugesan, S. Deepa, Nair (2012) Deepa S Nair, (1,2) - domination in Graphs, J Math Comput. 2(4), 774-783.

N. Murugesan, S. Deepa, Nair (2011) The Domination and Independence of Some Cubic Bipartite Graphs. 6(13), 611-618.

Narsingh Deo (1974) Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall.

Steve Hedetniemi, Sandee Hedetniemi (1,2) - Domination in Graphs.

(1,2) - Domination in Some Harmonius Graphs

Published

2013-02-25

How to Cite

(1, 2) - Domination in Some Harmonius Graphs. (2013). Global Journal of Science Frontier Research, 13(8), 65-74. https://journalofscience.org/index.php/GJSFR/article/view/