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

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

Журнал

Quaestiones Mathematicae
ISSN: 1607-3606

Вых. Данные

Год: 2024, Том: 47, Номер: 11, Страницы: 2283-2294 Страниц : 12 DOI: 10.2989/16073606.2024.2365365

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

Total dominating set, coalition, total coalition, tree

Авторы

Alikhani Saeid ¹ , Bakhshesh Davood ² , Golmohammadi Hamidreza ^3,4

Организации

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

We define a total coalition in a graph G as a pair of disjoint subsets A1,A2 ⊆ A that satisfy the following conditions: (a) neither A1 nor A2 constitutes a total dominating set of G, and (b) A1 ∪ A2 constitutes a total dominating set of G. A total coalition partition of a graph G is a partition ϒ = {A1,A2, . . . ,Ak} of its vertex set such that no subset of ϒ acts as a total dominating set of G, but for every set Ai ∈ ϒ, there exists a set Aj ∈ ϒ such that Ai and Aj combine to form a total coalition. We define the total coalition number of G as the maximum cardinality of a total coalition partition of G, and we denote it by Ct(G). The purpose of this paper is to begin an investigation into the characteristics of total coalition in graphs.

Alikhani S. , Bakhshesh D. , Golmohammadi H.
Total coalitions in graphs
Quaestiones Mathematicae. 2024. V.47. N11. P.2283-2294. DOI: 10.2989/16073606.2024.2365365 WOS Scopus OpenAlex

Поступила в редакцию:	3 дек. 2023 г.
Опубликована online:	7 июл. 2024 г.
Опубликована в печати:	3 дек. 2024 г.

Web of science:	WOS:001264642200001
Scopus:	2-s2.0-85197702705
OpenAlex:	W4400427885

БД	Цитирований
OpenAlex	8
Scopus	10
Web of science	10