Total coalitions of cubic graphs of order at most 10 Научная публикация
| Журнал |
Communications in Combinatorics and Optimization
ISSN: 2538-2128 , E-ISSN: 2538-2136 |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2025, Том: 10, Номер: 3, Страницы: 601-615 Страниц : 15 DOI: 10.22049/CCO.2024.29015.1813 | ||||
| Ключевые слова | coalition, total coalition, cubic graphs, Petersen graph. | ||||
| Авторы |
|
||||
| Организации |
|
Информация о финансировании (1)
| 1 |
Министерство науки и высшего образования РФ Математический центр в Академгородке |
075-15-2019-1613, 075-15-2022-281 |
Реферат:
A total coalition in a graph G = (VE) consists of two disjoint sets of vertices V1 and V2, neither of which is a total dominating set but whose union V1 V2, is a total dominating set. A total coalition partition in a graph G of order n = V is a vertex partition = V1 V2 Vk such that every set Vi dominating set but forms a total coalition with another set Vj is not a total which is not a total dominating set. The total coalition number TC(G) equals the maximum order k of a total coalition partition of G. In this paper, we determine the total coalition number of all cubic graphs of order n 10.
Библиографическая ссылка:
Golmohammadi H.
Total coalitions of cubic graphs of order at most 10
Communications in Combinatorics and Optimization. 2025. Т.10. №3. С.601-615. DOI: 10.22049/CCO.2024.29015.1813 WOS Scopus
Total coalitions of cubic graphs of order at most 10
Communications in Combinatorics and Optimization. 2025. Т.10. №3. С.601-615. DOI: 10.22049/CCO.2024.29015.1813 WOS Scopus
Даты:
| Поступила в редакцию: | 27 сент. 2023 г. |
| Принята к публикации: | 25 янв. 2024 г. |
| Опубликована online: | 30 янв. 2024 г. |
| Опубликована в печати: | 20 янв. 2025 г. |
Идентификаторы БД:
| Web of science: | WOS:001155718900001 |
| Scopus: | 2-s2.0-105007057629 |