Study on Even Sum Domination Number of Some Graphs

Let G be a connected graph and uv is an element of E ( G ). We say, the vertex v even sum dominates u (u u even sum dominates v ) if deg(v)+deg(u) ( v )+ deg ( u ) is an even number. A set S is an even sum dominating set (ESDS) if every vertex v is an element of V is either in S or even sum dominated by a vertex in S . An even sum dominating set S is a mimimal even sum dominating set if no proper subset S ' even sum dominating set. The even sum domination number gamma es ( G ) of a graph G is the minimum cardinality of an even sum dominating set of G . In this paper, we discuss some properties and bounds for this concept. We also derive even sum domination number for some standard graphs. 2020 Mathematics Subject Classifications: : 05C45, 05C69 subset of S S is an