In this paper, we provide an upper bound for the intersection number in the join and corona of graphs. Moreover, we give formulas for the intersection number of Kn ◦G, Pn ◦G, Cn ◦G and Crn.
In this paper, we characterized the [Formula: see text]-cost effective dominating sets in the corona and lexicographic product of graphs. Further, we give some formulas for the corona of graphs and upper bound for the lexicographic product of graphs.
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.