On k-Cost Effective Domination Number in the Join of Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v14i4.4127Keywords:
k-cost effective set, cost effective domination index, maximal cost effective domination.Abstract
In this paper, we characterize the k-cost effective domination in the join of graphs.
Further, we investigate the k-cost effective domination, cost effective domination index, maximal cost effective domination in the join of graphs.
Downloads
Published
2021-11-10
How to Cite
Palco, J. B., Paluga, R. N., & Malacas, G. A. (2021). On k-Cost Effective Domination Number in the Join of Graphs. European Journal of Pure and Applied Mathematics, 14(4), 1324–1336. https://doi.org/10.29020/nybg.ejpam.v14i4.4127
Issue
Section
Nonlinear Analysis
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.