Indian Journal of Science and Technology
Year: 2024, Volume: 17, Issue: Special Issue 1, Pages: 144-148
Original Article
G Mahadevan1*, K Priya1, C Sivagnanam2
1Department of Mathematics, The Gandhigram Rural Institute - Deemed to be University, Gandhigram, Tamil Nadu, India
2Mathematics and Computing Skills Unit, Sur, Sultanate of Oman
*Corresponding Author
Email: [email protected]
Received Date:29 August 2023, Accepted Date:05 March 2024, Published Date:31 May 2024
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
© 2024 Mahadevan et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Published By Indian Society for Education and Environment (iSee)
Subscribe now for latest articles and news.