Open AccessComplete Cototal Domination Number of Middle Graphs
Author(s) -
K. Uma Samundesvari,
J. Maria Regila Baby
Publication year - 2020
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.e2744.039520
Subject(s) - dominating set , domination analysis , combinatorics , cardinality (data modeling) , mathematics , set (abstract data type) , discrete mathematics , graph , computer science , vertex (graph theory) , data mining , programming language
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom