Amirkabir University of Technology AUT Journal of Mathematics and Computing 2783-2449 6 4 2025 10 01 Co-even domination number of a modified graph by operations on a vertex or an edge 289 295 5457 10.22060/ajmc.2024.22929.1204 EN Nima Ghanbari Department of Mathematical Sciences, Yazd University, 89195-741, Yazd, Iran Saeid Alikhani Department of Mathematical Sciences, Yazd University, 89195-741, Yazd, Iran 0000-0002-1801-203X Mohammad Ali Dehghanizadeh Department of Basic Sciences, Technical and Vocational University(TVU), Tehran, Iran 0000-0001-6327-6416 Journal Article 2024 01 16 Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is the domination number of $G$. A dominating set $D$ is called co-even dominating set if the degree of vertex $v$ is even number for all $v\in V\setminus D$. The cardinality of a smallest co-even dominating set of $G$, denoted by $\gamma _{coe}(G)$, is the co-even domination number of $G$. In this paper, we study co-even domination number of graphs which constructed by some operations on a vertex or an edge of a graph. https://ajmc.aut.ac.ir/article_5457_618b0fffdfdb50766e4d51574bc4e533.pdf