Upper Distance k-Cost Effective Number in the Join of Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v13i3.3657Keywords:
Distance k-cost effective set, upper distance k-cost effective number, join, t-fringe set, t- incrementAbstract
Let k be a positive integer and G be a connected graph. The open k-neighborhood set Nk G(v) of v ∈ V (G) is the set Nk G(v) = {u ∈ V (G) \ {v} : dG(u, v) ≤ k}. A set S of vertices of G is a distance k- cost effective if for every vertex u in S, |Nk G(u) ∩ Sc| − |NkG(u) ∩ S| ≥ 0. The maximum cardinality of a distance k- cost effective set of G is called the upper distance k- cost effective number of G. In this paper, we characterized a distance k- cost effective set in the join of two graphs. As direct consequences, the bounds or the exact values of the upper distance k- cost effective numbers are determined.
Downloads
Published
Issue
Section
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.