Exploration of CPCD number for power graph

Authors

S. Anuthiya, The Gandhigram Rural Institute - Deemed to be University, Gandhigram, Tamilnadu, India.Follow
G. Mahadevan, The Gandhigram Rural Institute - Deemed to be University, Gandhigram, Tamilnadu, India.Follow
C. Sivagnanam, Department of General Requirments, University of Technology and Applied Sciences- Sur, Sultanate of Oman.Follow

Abstract

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

Keywords

Corona domination number, Cycle, Path, Pendent vertex, Perfect matching, Support vertex

Article Type

Special Issue Article

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite this Article

Anuthiya, S.; Mahadevan, G.; and Sivagnanam, C. (2023) "Exploration of CPCD number for power graph," Baghdad Science Journal: Vol. 20: Iss. 1, Article 43.
DOI: https://doi.org/10.21123/bsj.2023.8423