(1, 2) - Domination in Some Harmonius Graphs
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.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
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.
Published
2013-02-25
Issue
Section
License
Copyright (c) 2013 Authors and Global Journals Private Limited

This work is licensed under a Creative Commons Attribution 4.0 International License.