The global connected domination in cartesian graphs
D. Udayakumar, A. Sasireka · Bulletin of Pure & Applied Sciences- Mathematics and Statistics · 2010
A subset S of vertices of a Cartesian graph GoH is called a global connected dominating set if S is both a global dominating set and a connected dominating set. The global connected domination number is the minimum cardinality of a global connected dominating set of GoH and is denoted by Ygc(GoH). In this paper, sharp bounds for Ygc(GoH) are supplied and all Cartesian graphs attaining these bounds are characterized. We also characterize the Cartesian product on complete graph G and H of order mxn with Ygc =n where 2:5n:5m. m is the order of G and n is the order of H.