Exploration of CPCD number for power graph
-
Published:2023-03-04
Issue:1(SI)
Volume:20
Page:0380
-
ISSN:2411-7986
-
Container-title:Baghdad Science Journal
-
language:
-
Short-container-title:Baghdad Sci.J
Author:
Anuthiya S.ORCID,
Mahadevan G.ORCID,
Sivagnanam C.ORCID
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.
Publisher
College of Science for Women
Subject
General Physics and Astronomy,Agricultural and Biological Sciences (miscellaneous),General Biochemistry, Genetics and Molecular Biology,General Mathematics,General Chemistry,General Computer Science