Abstract

In a graph G, a subset S of V is Global vertex-edge dominating set if S is vertex-edge dominating set in both G and \({\overline{G}}\).In this paper, we have introduced the new concept, Global vertex-edge dominating set, and identified the Global vertex–edge domination number of Total graph of Kn, K1, n − 1, K n,m, Pn, and Cn. An attempt is made to identify the Global vertex-edge domination number of Cartesian product of path Pn and cycle Cn.

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