Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call