Bounds on powerful alliance numbers
Abbreviated Journal Title
domination; defensive alliances; offensive alliances; powerful; alliances; global alliances; extremal graphs; Mathematics
Let G = (V, E) be a graph. Then S subset of V is an excess-t global powerful alliance if vertical bar N[upsilon] boolean AND S vertical bar >= vertical bar N[upsilon] boolean AND (V - S)vertical bar + t for every Epsilon is an element of V. If t = 0 this definition reduces to that of a global powerful alliance. Here we determine bounds on the cardinalities of such sets S.
"Bounds on powerful alliance numbers" (2008). Faculty Bibliography 2000s. 153.