EDGE DOMINATION IN SOME BRICK PRODUCT GRAPHS

Let G = V;E be a simple connected and undirected graph. A set F of edges in G is called an edge dominating set if every edge e in E - F is adjacent to at least one edge in F. The edge domination number 0 G of G is the minimum cardinality of an edge dominating set of G. The shadow graph of G, denoted D2 G is the graph constructed from G by taking two copies of G, say G itself and G' and joining each vertex u' in G' to the neighbors of the corresponding vertex u 0 in G'. Let D be the set of all distinct pairs of vertices in G and let Ds called the distance set be a subset of D. The distance graph of G, denoted by D G;Ds is the graph having the same vertex set as that of G and two vertices u and v are adjacent in D G;Ds whenever d u; v 2 Ds. In this paper, we determine the edge domination number of the shadow distance graph of the brick product graph C 2n; m; r .

___

  • Brian Alspach, C.C. Chen, Kevin McAvaney., (1996), On a class of Hamiltonian laceable 3-regular graphs,Discrete Mathematics, 151, pp. 19-38. .
  • S.K.Vaidya and R.M.Pandit., (2014), Edge domination in some path and cycle related graphs, Hindawi Publishing, ISRN Discrete Mathematics, 975812, pp.1-5.
  • U. Vijaya Chandra Kumar and R. Murali., (2016), Edge Domination in Shadow distance Graphs , International journal of Mathematics and its applications, pp . 125 - 130.
  • U. Vijaya Chandra Kumar and R. Murali., (2017), Edge Domination in Shadow distance Graph of some star related graphs, Annals of Pure and Applied Mathematics and its applications, pp. 33-40.
  • S.T.Hedetniemi and R.C.Laskar., (1990), Bibliography on domination in graphs and some basic defi- nitions of domination parameters, Discrete Mathematics, pp.257277.
  • V.R.Kulli., (2013), Theory of domination in graphs, Vishwa International Publications.
  • S.R.Jayaram., (1987), Line domination in graphs, Graphs Combin.3, pp. 357-363.
  • Frank Harary., (1969), Graph Theory, Addison - Wesley Publications.