Forcing Independent Domination Number of a Graph
DOI:
https://doi.org/10.29020/nybg.ejpam.v12i4.3484Keywords:
domination, forcing, independent, join, corona, lexicographic productAbstract
In this paper, we obtain the forcing independent domination number of some special graphs. Further, we determine the forcing independent domination number of graphs under some binary operations such join, corona and lexicographic product of two graphs.Downloads
Published
2019-10-31
Issue
Section
Nonlinear Analysis
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.
How to Cite
Forcing Independent Domination Number of a Graph. (2019). European Journal of Pure and Applied Mathematics, 12(4), 1371-1381. https://doi.org/10.29020/nybg.ejpam.v12i4.3484