Open AccessRESULTS ON DISTANCE-2 DOMINATION SUBDIVISION NUMBER OF CARTESIAN PRODUCT GRAPH
Author(s) -
G. Hemalatha,
P. Jeyanthi
Publication year - 2017
Publication title -
zenodo (cern european organization for nuclear research)
Language(s) - English
DOI - 10.5281/zenodo.290133
Subject(s) - cartesian product , subdivision , graph , mathematics , product (mathematics) , combinatorics , geometry , geography , archaeology
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