Analysing of complementary perfect hop domination numeral of corona products of graphs. (16th December 2021)

• Record Type: Journal Article
• Authors: Mahadevan, G.; Vijayalakshmi, V.
• Is Part Of: International journal of dynamical systems and differential equations. Volume 11:Number 5/6(2021)
• Page Start: 579
• Page End: 593
• Publication Date: 2021-12-16
• Subjects: complementary perfect hop dominating set -- hop dominating set -- corona product -- distance -- complementary perfect hop domination number -- hop domination number -- perfect matching -- matching -- corona product of two distinct paths -- corona product of two distinct cycles -- corona product of path and cycle -- corona product of cycle and path; Differential equations -- Periodicals; 515.35
• Languages: English
• ISSNs: 1752-3583

Abstract

Recently, the authors introduced the concept of Complementary perfect hop domination number of a graph. A set S ⊆ V is a hop dominating set of G, if every vertex v ∈ V - S there exists u ∈ S such that d(u, v) = 2. A set S ⊆ V is said to be complementary perfect hop dominating set of G, if S is a hop dominating set and < V - S > has atleast one perfect matching. The minimum cardinality of complementary perfect hop dominating sets is called complementary perfect hop domination number of G and it is denoted by CPHD(G). In this paper we explore the CPHD number for the Corona product of two distinct paths and cycles.