GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT
(Springer Nature, 2021-01)
In this paper we study the problem of finding small defensive and offensive alliances in a simple graph. Given a graph G=(V,E) and a subset S⊆V(G) , we denote by dS(v) the degree of a vertex v∈V in G[S], the subgraph of G ...