Strong coalitions in graphs | Sciact - Система учета научной деятельности ИМ СО РАН

Strong coalitions in graphs Научная публикация

Журнал

Discrete Mathematics, Algorithms and Applications
ISSN: 1793-8309

Вых. Данные

Год: 2026, Страницы: 1-15 Страниц : 15 DOI: 10.1142/S1793830926500850

Ключевые слова

Coalition, strong dominating set, strong coalition

Авторы

Golmohammadi H. ^1,2 , Alikhani S. ³ , Ghanbari N. ³ , Takhonov I.I. ¹ , Abaturov A. ¹

Организации

1	Novosibirsk State University, Pirogova str. 2, Novosibirsk, 630090, Russia
2	Sobolev Institute of Mathematics, Ak. Koptyug av. 4, Novosibirsk, 630090, Russia
3	Department of Mathematical Sciences, Yazd University, 89195-741, Yazd, Iran

Информация о финансировании (1)

Министерство науки и высшего образования РФ

075-15-2025-348

For a graph G = (V, E), a set D ⊂ V (G) is a strong dominating set of G,if for every vertex x ∈ V (G) \ D there is a vertex y ∈ D with xy ∈ E(G) and deg(x) ≤ deg(y). A strong coalition consists of two disjoint sets of vertices V1 and V2, neither of which is a strong dominating set but whose union V1 ∪ V2 is a strong dominating set. A vertex partition Ω = {V1, V2, ..., Vk} of vertices in G is a strong coalition partition if every set Vi ∈ Ω either is a strong dominating set consisting of a single vertex of degree n − 1, or is not a strong dominating set but forms a strong coalition with another set Vj ∈ Ω that is not a strong dominating set. In this paper, we study properties of strong coalitions in graphs.

Golmohammadi H. , Alikhani S. , Ghanbari N. , Takhonov I.I. , Abaturov A.
Strong coalitions in graphs
Discrete Mathematics, Algorithms and Applications. 2026. P.1-15. DOI: 10.1142/S1793830926500850 OpenAlex

Поступила в редакцию:	31 июл. 2025 г.
Принята к публикации:	12 авг. 2026 г.
Опубликована online:	28 авг. 2026 г.

≡ OpenAlex:

W4394948172