Global vertex-edge domination chain and its characterization

Abstract

In agraph G, a subset S of V is Global vertex-edge dominating set if S is vertex-edge dominating set in both G and . In this paper we have introduced new concepts such as Global vertex-edge dominating set, Global vertex-edge irredundant set, Global independent vertex-edge domination set. Also we have identified the Global vertex-edge domination chain, An attempt is made to characterize the Global vertex-edge domination number of graphs. We have identified the graphs whose Global vertex-edge domination number is 1, 2, 3 & k.