Forcing Subsets of Connected Co-Independent Hop Domination in the Edge Corona and Lexicographic Product of Graphs
Keywords:Forcing subsets, connected co-independent hop, domination, co- independent set
This study deals with the forcing subsets of a minimum connected co-independent hop dominating sets in graphs. Bounds or exact values of the forcing connected co-independent hop domination numbers of graphs resulting from some binary operations such as
edge corona and lexicographic product of graphs are determined.
Some main results generated in this study include: (a) characterization of the minimum connected co-independent hop dominating sets; and (b) characterization of the forcing subsets for these types of sets.
How to Cite
Copyright (c) 2022 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.