Analysing of complementary perfect hop domination numeral of corona products of graphs
DOI10.1504/IJDSDE.2021.120048zbMATH Open1482.05273OpenAlexW4206557142WikidataQ115237302 ScholiaQ115237302MaRDI QIDQ2113782FDOQ2113782
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
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
distancematchingperfect matchingcorona productcomplementary perfect hop dominating setcomplementary perfect hop domination numbercorona product of cycle and pathcorona product of path and cyclecorona product of two distinct cyclescorona product of two distinct pathshop dominating sethop domination number
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)
Cited In (3)
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)