Results On Distance-2 Domination Subdivision Number Of Cartesian Product Graph
G. Hemalatha, Pon Jeyanthi · Zenodo (CERN European Organization for Nuclear Research) · 2017
Let be a simple graph on the vertex set . In a graph G, A set is a dominating set of G if every vertex in is adjacent to some vertex in D. The bondage number of a graph [ is the cardinality of a smallest set of edges whose removal results in a graph with domination number larger than that of . A set is called a distance k dominating set of if every vertex in is with in distance of at least one vertex in , that is, for every vertex , there exists a vertex such that . In this paper we determine the domination number of Cartesian product graph in distance two dominating set and also find the subdivision number for Cartesian product graph.