Complete Cototal Domination Number of Middle Graphs
K. Uma Samundesvari1, J. Maria Regila Baby2
1K. Uma Samundesvari, Department of Mathematics, Noorul Islam Centre For Higher Education Kumaracoil, Tamil Nadu, India.
2J. Maria Regila Baby, Department of Mathematics, Noorul Islam Centre For Higher Education Kumaracoil, Tamil Nadu, India.
Manuscript received on February 10, 2020. | Revised Manuscript received on February 25, 2020. | Manuscript published on March 10, 2020. | PP: 2085-2087 | Volume-9 Issue-5, March 2020. | Retrieval Number: E2744039520/2020©BEIESP | DOI: 10.35940/ijitee.E2744.039520
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: A total dominating set is said to be a complete cototal dominating set if the has no isolated nodes. The complete cototal domination number is the minimum cardinality of a complete cototal dominating set of . Our aim is to determine the Complete Cototal Domination Number of Middle Graphs and its bounds.
Keywords: Domination Number, Total Domination Number, Cototal Domination Number, Complete cototal Domination Number, Middle Graph. MSC 2010 Subject Classification, 05C69
Scope of the Article: Classification