Analysing of complementary perfect hop domination numeral of corona products of graphs
by G. Mahadevan; V. Vijayalakshmi
International Journal of Dynamical Systems and Differential Equations (IJDSDE), Vol. 11, No. 5/6, 2021

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.

Online publication date: Wed, 05-Jan-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Dynamical Systems and Differential Equations (IJDSDE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com