z-logo
open-access-imgOpen Access
On k-Cost Effective Domination Number in the Join of Graphs
Author(s) -
Jesrael Bataluna Palco,
Rolando N. Paluga,
Gina A. Malacas
Publication year - 2021
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v14i4.4127
Subject(s) - join (topology) , mathematics , domination analysis , combinatorics , index (typography) , discrete mathematics , graph , computer science , world wide web , vertex (graph theory)
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here