Journal Article

Complete Cototal Domination Number of Middle Graphs

  • Samundesvari* K
  • et al.
International Journal of Innovative Technology and Exploring Engineering (2020) 9(5) 2085-2087
DOI: 10.35940/ijitee.e2744.039520
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Samundesvari*, K. U., & Baby, J. M. R. (2020). Complete Cototal Domination Number of Middle Graphs. International Journal of Innovative Technology and Exploring Engineering, 9(5), 2085–2087. https://doi.org/10.35940/ijitee.e2744.039520

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free