Co-even domination number of a modified graph by operations on a vertex or an edge
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 calle...
Wedi'i Gadw mewn:
| Prif Awduron: | , , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Amirkabir University of Technology
2025-10-01
|
| Cyfres: | AUT Journal of Mathematics and Computing |
| Pynciau: | |
| Mynediad Ar-lein: | https://ajmc.aut.ac.ir/article_5457_6d22b7f34953426f4364a3f8d13e5107.pdf |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|