Contents

-

Bounds on Powerful Alliance Numbers

Robert C.Brigham1, Ronald D.Dutton1
1School of Computer Science University of Central Florida, Orlando FL 32816

Abstract

Let G=(V,E) be a graph. Then SV is an excess-t global powerful alliance if |N[v]S||N[v](VS)|+t for every vV. If t=0, this definition reduces to that of a globalpowerfulalliance. Here we determine bounds on the cardinalities of such sets S.