Strong coalitions in graphs › Обзор исследований

Standard

Strong coalitions in graphs. / Golmohammadi, H.; Alikhani, S.; Ghanbari, N. и др.

в: Discrete Mathematics, Algorithms and Applications, 2026.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Golmohammadi, H, Alikhani, S, Ghanbari, N, Takhonov, II & Abaturov, A 2026, 'Strong coalitions in graphs', Discrete Mathematics, Algorithms and Applications. https://doi.org/10.1142/s1793830926500850

APA

Golmohammadi, H., Alikhani, S., Ghanbari, N., Takhonov, I. I., & Abaturov, A. (2026). Strong coalitions in graphs. Discrete Mathematics, Algorithms and Applications, [2650085]. https://doi.org/10.1142/s1793830926500850

Vancouver

Golmohammadi H, Alikhani S, Ghanbari N, Takhonov II, Abaturov A. Strong coalitions in graphs. Discrete Mathematics, Algorithms and Applications. 2026;2650085. doi: 10.1142/s1793830926500850

Author

Golmohammadi, H. ; Alikhani, S. ; Ghanbari, N. и др. / Strong coalitions in graphs. в: Discrete Mathematics, Algorithms and Applications. 2026.

BibTeX

@article{cd98c37d935646d7bd2c498e1a9c3f72,

title = "Strong coalitions in graphs",

abstract = "For a graph G = (V,E), a set D ⊂ V (G) is a strong dominating set of G, if for everyvertex x ∈ V (G)\D there is a vertex y ∈ D with xy ∈ E(G) and deg(x) ≤ deg(y). Astrong 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.",

keywords = "coalition, strong dominating set, strong coalition",

author = "H. Golmohammadi and S. Alikhani and N. Ghanbari and I.I. Takhonov and A. Abaturov",

note = "The work of Hamidreza Golmohammadi was supported by the Mathematical Center in Akademgorodok under the agreement No. 075-15-2025-348 with the Ministry of Science and Higher Education of the Russian Federation.",

year = "2026",

doi = "10.1142/s1793830926500850",

language = "English",

journal = "Discrete Mathematics, Algorithms and Applications",

issn = "1793-8309",

publisher = "World Scientific Publishing Co. Pte Ltd",

}

RIS

TY - JOUR

T1 - Strong coalitions in graphs

AU - Golmohammadi, H.

AU - Alikhani, S.

AU - Ghanbari, N.

AU - Takhonov, I.I.

AU - Abaturov, A.

N1 - The work of Hamidreza Golmohammadi was supported by the Mathematical Center in Akademgorodok under the agreement No. 075-15-2025-348 with the Ministry of Science and Higher Education of the Russian Federation.

PY - 2026

Y1 - 2026

N2 - For a graph G = (V,E), a set D ⊂ V (G) is a strong dominating set of G, if for everyvertex x ∈ V (G)\D there is a vertex y ∈ D with xy ∈ E(G) and deg(x) ≤ deg(y). Astrong 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.

AB - For a graph G = (V,E), a set D ⊂ V (G) is a strong dominating set of G, if for everyvertex x ∈ V (G)\D there is a vertex y ∈ D with xy ∈ E(G) and deg(x) ≤ deg(y). Astrong 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.

KW - coalition

KW - strong dominating set

KW - strong coalition

UR - https://www.mendeley.com/catalogue/f40c93f1-6dc7-3e8a-b7c9-60607a183a55/

U2 - 10.1142/s1793830926500850

DO - 10.1142/s1793830926500850

M3 - Article

JO - Discrete Mathematics, Algorithms and Applications

JF - Discrete Mathematics, Algorithms and Applications

SN - 1793-8309

M1 - 2650085

ER -

ID: 83450309