Powerful alliances in graphs
Abbreviated Journal Title
Alliance; Defensive alliance; Offensive alliance; Powerful alliance; Global powerful alliance; Domination; NUMBERS; Mathematics
For a graph G = (V, E). a non-empty set S subset of V is a defensive alliance if for every vertex v in S, v has at most one more neighbor in V - S than it has in S, and S is an offensive alliance if for every v is an element of V - S that has a neighbor in S, v has more neighbors in S than in V - S. A powerful alliance is both defensive and offensive. We initiate the study of powerful alliances in graphs. (C) 2008 Elsevier B.V. All rights reserved.
"Powerful alliances in graphs" (2009). Faculty Bibliography 2000s. 7053.