Complementary 3-domination number in some Special graphs and Cubic graphs
Main Article Content
Abstract
A subset S of a graph G is called a dominating set of G if every vertex in V-S is adjacent to atleast one vertex in S. The domination number
Article Details
Issue
Section
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
How to Cite
References
Mahadevan G and Mydeen bibi A (2009), “Characterization of Two domination number and Chromatic number
of a graph”,-preprint.
Mahadevan G, Selvam Avadayappan A and Mydeenbibi G, “Cubic graphs with equal domination number and
Chromatic number”, International Journal of Inormation Technology and Knowlwdge Management, July-December
, Volume 4, No.2,pp.379-383.
Harary F, “Graph Theory”, Addison-Wesley, Reading MA (1969).
Kulli V R, “Theory of Domination in Graphs”, Vishwa International Publications, Gulburga, India (2010).
Mahadevan G, Selvam Avadayappan, Bhagavathi Ammal V.G and Subramanian T “Restrained Triple Connected
Domination Number of a Graph”, International Journal of Engineering Research and Applications(IJERA) ISSN:
-9622 www.ijera.com Vol.2, Issue 6,November-December 2012,pp[225-229].
Mahadevan G, Selvam Avadayappan A and Mydeenbibi G, “Cubic graphs with equal Two Domination number
and Chromatic Number”, International Journal of Information Technology and Knowledge Management, JulyDecember 2011,volume 4,No.2,pp.[379-383].
Mahadevan G, Selvan Avadayappan A and Mydeenbibi A,”Characterization of Complementary connected
Domination number of a Graph”,International Journal of Mathematics and Soft Computing,Vol.2,No.1(2012),[119-
.
Mehry S and Safakish R,”Three Domination number and Connectivity in
Graphs:,arXiv:1502.04458v1[math.CO]16 Feb2015.
Teresa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater, “Fundamentals of Dominaion in Graphs”, Marcel
Dekker, Newyork (1998).