Forcing Subsets for γc-sets and γt-sets in the Lexicographic Product of Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v12i4.3485Keywords:
connected domination, total domination, forcing subset, lexicographic productAbstract
In this paper, the connected dominating sets and total dominating sets in the lexicographic product of two graphs are characterized. Further, the connected domination, total domination, forcing connected domination and forcing total domination numbers of these graphs are determined.
Downloads
Published
2019-10-31
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.
How to Cite
Forcing Subsets for γc-sets and γt-sets in the Lexicographic Product of Graphs. (2019). European Journal of Pure and Applied Mathematics, 12(4), 1779-1786. https://doi.org/10.29020/nybg.ejpam.v12i4.3485