Forcing Subsets of Connected Co-Independent Hop Domination in the Edge Corona and Lexicographic Product of Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v15i4.4521Keywords:
Forcing subsets, connected co-independent hop, domination, co- independent setAbstract
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.
Downloads
Published
Issue
Section
License
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 European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.