In this paper we study defensive alliances in some regular graphs. We determine which subgraphs could a critical defensive alliance of a graph \(G\) induce, if \(G\) is \(6\)-regular and the cardinality of the alliance is at most \(8\).
Citation
G. Araujo-Pardo, L. Barriére. Defensive Alliances in Regular Graphs[J], Ars Combinatoria, Volume 115. 35-54. .
