Double total coalitions in graphs Full article
| Journal |
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304 |
||||||
|---|---|---|---|---|---|---|---|
| Output data | Year: 2025, Volume: 22, Number: 2, Pages: 1497–1506 Pages count : 10 DOI: 10.33048/semi.2025.22.090 | ||||||
| Tags | Coalition; double total coalition, double total dominating set. | ||||||
| Authors |
|
||||||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0017 |
Abstract:
Let G be a graph of minimum degree at least two. A set D of vertices of a graph G with the vertex set V is a double total dominating set of G, if every vertex v has at least two neighbors in D. A double total coalition consists of two disjoint sets of vertices V1 and V2, neither of which is a double total dominating set but their union V1∪V2 is a double total dominating set. A double total coalition partition of a graph Gis a partition Θ = {V1,V2,...,Vk} of V such that no subset of Θ is a double total dominating set of G, but for every set Vi ∈ Θ, there exists a set Vj ∈ Θ such that Vi and Vj form a double total coalition. In this paper we initiate the study of the double total coalition by setting some basic results, giving exact values and bounds for the double total coalition number.
Cite:
Golmohammadi H.
, Alikhani S.
, Bakhshesh D.
Double total coalitions in graphs
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2025. V.22. N2. P.1497–1506. DOI: 10.33048/semi.2025.22.090 Scopus
Double total coalitions in graphs
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2025. V.22. N2. P.1497–1506. DOI: 10.33048/semi.2025.22.090 Scopus
Dates:
| Submitted: | Apr 23, 2025 |
| Published print: | Dec 9, 2025 |
| Published online: | Dec 9, 2025 |
Identifiers:
| Scopus: | 2-s2.0-105024787653 |
Citing:
Пока нет цитирований