Strong Alliances in Graphs
For any simple connected undirected graph $G=(V,E)$, a \textit{defensive alliance} is a subset $S$ of $V$ satisfying the condition that every vertex $v\in S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the \textit{all...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Azarbaijan Shahide Madani University
2019-06-01
|
| Series: | Communications in Combinatorics and Optimization |
| Subjects: | |
| Online Access: | http://comb-opt.azaruniv.ac.ir/article_13785_db97a57dfa7d3980c88f4ce8245a31b6.pdf |