Total restrained coalitions in graphs Научная публикация
| Журнал |
Computational and Applied Mathematics
ISSN: 2238-3603 , E-ISSN: 1807-0302 |
||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Вых. Данные | Год: 2026, Том: 45, Номер статьи : 50, Страниц : DOI: 10.1007/s40314-025-03439-w | ||||||||||
| Ключевые слова | Coalition · Total restrained coalition · Total restrained dominating set | ||||||||||
| Авторы |
|
||||||||||
| Организации |
|
Информация о финансировании (1)
| 1 | Институт математики им. С.Л. Соболева СО РАН | FWNF-2022-0017 |
Реферат:
Avertex set in a graph without isolated vertices is a total restrained dominating set (TRDset) if it is dominating, induces a subgraph without isolated vertices, and the vertices not in the set also induce a subgraph without isolated vertices. Two vertex sets, which are not TRD-sets, form a total restrained coalition if their union is a TRD-set. A total restrained coalition partition is a partition where none of its elements are TRD-sets, but each forms a total restrained coalition with another element. The goal is to maximize the cardinality of such a partition, denoted Ctr(G). We initiate the study of this concept by proving certain properties, extremal values, general bounds, and its relation to known structural parameters. Exact values for specific graph families are also provided.
Библиографическая ссылка:
Golmohammadi H.
, Chellali M.
, Matrokhin N.A.
, Takhonov I.I.
, Valenzuela-Tripodoro J.C.
Total restrained coalitions in graphs
Computational and Applied Mathematics. 2026. V.45. 50 . DOI: 10.1007/s40314-025-03439-w Scopus
Total restrained coalitions in graphs
Computational and Applied Mathematics. 2026. V.45. 50 . DOI: 10.1007/s40314-025-03439-w Scopus
Даты:
| Поступила в редакцию: | 11 мар. 2025 г. |
| Принята к публикации: | 8 сент. 2025 г. |
| Опубликована online: | 15 окт. 2025 г. |
Идентификаторы БД:
| Scopus: | 2-s2.0-105018820469 |
Цитирование в БД:
Пока нет цитирований