On k-Cost Effective Domination Number in the Join of Graphs

Authors

  • Jesrael Bataluna Palco Mindanao State University at Naawan
  • Rolando N. Paluga
  • Gina A. Malacas

DOI:

https://doi.org/10.29020/nybg.ejpam.v14i4.4127

Keywords:

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

Issue

Vol. 14 No. 4: (October 2021)

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

On k-Cost Effective Domination Number in the Join of Graphs. (2021). European Journal of Pure and Applied Mathematics, 14(4), 1324-1336. https://doi.org/10.29020/nybg.ejpam.v14i4.4127