پیوندهای مفید
آمار
| تعداد نشریات | 8 |
| تعداد شماره‌ها | 428 |
| تعداد مقالات | 5,579 |
| تعداد مشاهده مقاله | 6,869,730 |
| تعداد دریافت فایل اصل مقاله | 5,836,842 |
Co-even domination number of a modified graph by operations on a vertex or an edge | ||
| AUT Journal of Mathematics and Computing | ||
| مقاله 1، دوره 6، شماره 4، دی 2025، صفحه 289-295 اصل مقاله (366.83 K) | ||
| نوع مقاله: Original Article | ||
| شناسه دیجیتال (DOI): 10.22060/ajmc.2024.22929.1204 | ||
| نویسندگان | ||
| Nima Ghanbari1؛ Saeid Alikhani* 1؛ Mohammad Ali Dehghanizadeh2 | ||
| 1Department of Mathematical Sciences, Yazd University, 89195-741, Yazd, Iran | ||
| 2Department of Basic Sciences, Technical and Vocational University(TVU), Tehran, Iran | ||
| چکیده | ||
| 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. | ||
| کلیدواژه‌ها | ||
| Domination number؛ Co-even dominating set؛ Vertex removal؛ Edge removal؛ Contraction | ||
|
آمار تعداد مشاهده مقاله: 308 تعداد دریافت فایل اصل مقاله: 99 |
||