Answers are grounded in this paper and cite their sources.
A secure coalition in graph [Formula: see text] consists of two disjoint vertex sets [Formula: see text] and [Formula: see text], neither of which is a secure dominating set, but whose union [Formula: see text] is a secure dominating set. A secure coalition partition ([Formula: see text]-partition) of [Formula: see text] is a vertex partition [Formula: see text] in which each set [Formula: see text] is either a secure dominating set consisting of a single vertex of degree [Formula: see text], or is not a secure dominating set but forms a secure coalition with some other set [Formula: see text]. The maximum order of a secure coalition partition of [Formula: see text] is called the secure coalition number of [Formula: see text], denoted by [Formula: see text]. For every [Formula: see text]-partition [Formula: see text] of [Formula: see text], we associate a graph called the secure coalition graph of [Formula: see text] with respect to [Formula: see text], denoted by [Formula: see text], whose vertices correspond to sets [Formula: see text] of [Formula: see text], with two vertices adjacent if and only if their corresponding sets form a secure coalition in [Formula: see text]. In this study, we introduce secure coalition in graphs and investigate its fundamental properties. The proposed framework incorporates the vertex-exchange property of secure domination into coalition theory, distinguishing it from coalition variants based on properties such as total, connected, independent, and paired domination. We prove that every graph admits a [Formula: see text]-partition and characterize the graphs [Formula: see text] with [Formula: see text], as well as all trees [Formula: see text] with [Formula: see text]. We further demonstrate that every graph [Formula: see text] without isolated vertices is a secure coalition graph.
No takes yet. Share an insight, caveat, or question.
Udupa et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: