Study on Even Sum Domination Number of Some Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v17i3.5313Keywords:
Degree of a vertex, Domination number, Even sum domination numberAbstract
Let G be a connected graph and uv ∈ E(G). We say, the vertex v even sum dominates u (u even sum dominates v) if deg(v)+deg(u) is an even number. A set S is an even sum dominating set (ESDS) if every vertex v ∈ 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′⊂ S is an even sum dominating set. The even sum domination number γ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.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.