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

DOI10.1504/IJDSDE.2021.120048MaRDI QIDQ2113782zbMATH OpenOpenAlexWikidataFDO

Authors G. Mahadevan, V. Vijayalakshmi

Publication date 14 March 2022

Published in International Journal of Dynamical Systems and Differential Equations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijdsde.2021.120048

zbMATH Keywords

complementary perfect hop dominating setcomplementary perfect hop domination numbercorona productcorona product of cycle and pathcorona product of path and cyclecorona product of two distinct cyclescorona product of two distinct pathsdistancehop dominating sethop domination numbermatchingperfect matching

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Review text

Summary: Recently, the authors introduced the concept of Complementary perfect hop domination number of a graph. A set \(S \subseteq V\) is a hop dominating set of \(G\), if every vertex \(v\in V - S\) there exists \(u\in S\) such that \(d(u, v) = 2\). A set \(S \subseteq 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.

Recommendations

• Connected perfect hop dominating sets under some binary operations
• Clone hop domination number of a graph
• Total hop dominating sets in the join, corona and lexicographic product of graphs
• The geodetic hop domination number of complementary prisms
• Connected hop domination in graphs under some binary operations

Cited in

(3)

• Connected perfect hop dominating sets under some binary operations
• Clone hop domination number of a graph
• Explicating the exact \(\gamma_{\mathrm{CD}}\) value for the tensor product of graphs

This page was built for publication: Analysing of complementary perfect hop domination numeral of corona products of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113782)