Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2008 | ARS COMBINATORIA | domination, defensive alliances, offensive alliances, powerful alliances, global alliances, extremal graphs |
Field | DocType | Volume |
Discrete mathematics,Alliance,Calculus,Mathematics | Journal | 88 |
ISSN | Citations | PageRank |
0381-7032 | 1 | 0.35 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert C. Brigham | 1 | 157 | 26.74 |
| Ronald D. Dutton | 2 | 190 | 27.80 |