Standard

Total restrained coalitions in graphs. / Chellali, M.; Golmohammadi, H.; Matrokhin, N. A. и др.

в: Computational and Applied Mathematics, Том 45, № 2, 50, 2026.

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

Harvard

Chellali, M, Golmohammadi, H, Matrokhin, NA, Takhonov, II & Valenzuela-Tripodoro, JC 2026, 'Total restrained coalitions in graphs', Computational and Applied Mathematics, Том. 45, № 2, 50. https://doi.org/10.1007/s40314-025-03439-w

APA

Chellali, M., Golmohammadi, H., Matrokhin, N. A., Takhonov, I. I., & Valenzuela-Tripodoro, J. C. (2026). Total restrained coalitions in graphs. Computational and Applied Mathematics, 45(2), [50]. https://doi.org/10.1007/s40314-025-03439-w

Vancouver

Chellali M, Golmohammadi H, Matrokhin NA, Takhonov II, Valenzuela-Tripodoro JC. Total restrained coalitions in graphs. Computational and Applied Mathematics. 2026;45(2):50. doi: 10.1007/s40314-025-03439-w

Author

Chellali, M. ; Golmohammadi, H. ; Matrokhin, N. A. и др. / Total restrained coalitions in graphs. в: Computational and Applied Mathematics. 2026 ; Том 45, № 2.

BibTeX

@article{3cc4c90933b64d488f37f07c63bd8d0e,
title = "Total restrained coalitions in graphs",
abstract = "A vertex set in a graph without isolated vertices is a total restrained dominating set (TRD-set) 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.",
keywords = "Coalition, Total restrained coalition, Total restrained dominating set",
author = "M. Chellali and H. Golmohammadi and Matrokhin, {N. A.} and Takhonov, {I. I.} and Valenzuela-Tripodoro, {J. C.}",
note = "Funding for open access publishing: Universidad de C{\'a}diz/CBUA. Total restrained coalitions in graphs / M. Chellali, H. Golmohammadi, N. A. Matrokhin, I. I. Takhonov & J. C. Valenzuela-Tripodoro // Computational and Applied Mathematics. - 2025. - Т. 45. № 2. - С. 50. ",
year = "2026",
doi = "10.1007/s40314-025-03439-w",
language = "English",
volume = "45",
journal = "Computational and Applied Mathematics",
issn = "0101-8205",
publisher = "Springer Nature",
number = "2",

}

RIS

TY - JOUR

T1 - Total restrained coalitions in graphs

AU - Chellali, M.

AU - Golmohammadi, H.

AU - Matrokhin, N. A.

AU - Takhonov, I. I.

AU - Valenzuela-Tripodoro, J. C.

N1 - Funding for open access publishing: Universidad de Cádiz/CBUA. Total restrained coalitions in graphs / M. Chellali, H. Golmohammadi, N. A. Matrokhin, I. I. Takhonov & J. C. Valenzuela-Tripodoro // Computational and Applied Mathematics. - 2025. - Т. 45. № 2. - С. 50.

PY - 2026

Y1 - 2026

N2 - A vertex set in a graph without isolated vertices is a total restrained dominating set (TRD-set) 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.

AB - A vertex set in a graph without isolated vertices is a total restrained dominating set (TRD-set) 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.

KW - Coalition

KW - Total restrained coalition

KW - Total restrained dominating set

UR - https://www.scopus.com/pages/publications/105018820469

UR - https://www.mendeley.com/catalogue/c8b99df0-0fae-38f4-841e-92c9503614a2/

U2 - 10.1007/s40314-025-03439-w

DO - 10.1007/s40314-025-03439-w

M3 - Article

VL - 45

JO - Computational and Applied Mathematics

JF - Computational and Applied Mathematics

SN - 0101-8205

IS - 2

M1 - 50

ER -

ID: 71306308