تقرير
Independent domination stability in graphs
| العنوان: | Independent domination stability in graphs |
|---|---|
| المؤلفون: | Alikhani, Saeid, Mehraban, Mazharodin, Zakharov, Alexei, Golmohammadi, Hamidreza |
| سنة النشر: | 2023 |
| المجموعة: | Mathematics |
| مصطلحات موضوعية: | Mathematics - Combinatorics, 05C05, 05C69 |
| الوصف: | A non-empty set $S\subseteq V (G)$ of the simple graph $G=(V(G),E(G))$ is an independent dominating set of $G$ if every vertex not in $S$ is adjacent with some vertex in $S$ and the vertices of $S$ are pairwise non-adjacent. The independent domination number of $G$, denoted by $\gamma_i(G)$, is the minimum size of all independent dominating sets of $G$. The independent domination stability, or simply $id$-stability of $G$ is the minimum number of vertices whose removal changes the independent domination number of $G$. In this paper, we investigate properties of independent domination stability in graphs. In particular, we obtain several bounds and obtain the independent domination stability of some operations of two graphs. Comment: 10 pages, 2 figures |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2311.01733 |
| رقم الأكسشن: | edsarx.2311.01733 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |