Global defensive \(k\)-alliances in graphs (Q1003661): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57974424, #quickstatements; #temporary_batch_1711574657256 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57974424 / rank | |||
Normal rank |
Revision as of 23:58, 27 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Global defensive \(k\)-alliances in graphs |
scientific article |
Statements
Global defensive \(k\)-alliances in graphs (English)
0 references
4 March 2009
0 references
Let \(\Gamma=(V,E)\) be a simple graph. For a nonempty set \(X\subseteq V\), and a vertex \(v\subseteq V\), \(\delta_X(v)\) denotes the number of neighbors \(v\) has in \(X\). A nonempty set \(S\subseteq V\) is a defensive \(k\)-alliance in \(\Gamma =(V,E)\) if \(\delta_S(v)\geq\delta_{\overline S}(v)+k\). \(\forall v\in S\). A defensive \(k\)-alliance \(S\) is called global if it forms a dominating set. The global defensive \(k\)-alliance number of \(\Gamma\), denoted by \(\gamma^a_k(\Gamma)\), is the minimum cardinality of a defensive \(k\)-alliance in \(\Gamma\). We study the mathematical properties of \(\gamma^a_k(\Gamma)\).
0 references
defensive alliances
0 references
alliances in graphs
0 references
domination
0 references