Abstract
Objectives: A dominating set S of a graph G is said to be a complementary corona dominating set (CCD-set) if every vertex in is either a pendent vertex or a support vertex. The smallest cardinality of a CCD-set is called the CCD-number and is denoted by . In this article, we explore the CCD-number for some specific graphs. Methods: We are finding the upper bound of and the lower bound of . We prove that both the upper and lower bound are equal for the given graphs. Findings: In this article, we obtained the CCD-number for some specific graphs. Novelty: Complementary corona dominating set is a vertex set such that the induced subgraph of the complementary set is isomorphic to corona virus. Keywords: Dominating Set, Corona Dominating Set, Support And Pendent Vertex, Butterfly Graph, Dumbbell Graph, Coconut Tree Graph, Peacock Head Graph, Sunlet Graph, Spider Graph, Firecracker Graph, Uniform g-ply graph
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
