Title

Bounds on powerful alliance numbers

Authors

Authors

R. C. Brigham;R. D. Dutton

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

ARS Comb.

Keywords

domination; defensive alliances; offensive alliances; powerful; alliances; global alliances; extremal graphs; Mathematics

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.

Journal Title

Ars Combinatoria

Volume

88

Publication Date

1-1-2008

Document Type

Article

Language

English

First Page

135

Last Page

159

WOS Identifier

WOS:000257486100013

ISSN

0381-7032

Share

COinS