Title: Analysing of complementary perfect hop domination numeral of corona products of graphs

Authors: G. Mahadevan; V. Vijayalakshmi

Addresses: Department of Mathematics, Gandhigram Rural Institute – Deemed To Be University, Gandhigram, Dindigul-624302, India ' Department of Mathematics, Gandhigram Rural Institute – Deemed To Be University, Gandhigram, Dindigul-624302, India

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.

Keywords: 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.

DOI: 10.1504/IJDSDE.2021.120048

International Journal of Dynamical Systems and Differential Equations, 2021 Vol.11 No.5/6, pp.579 - 593

Accepted: 10 Jul 2020
Published online: 05 Jan 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article