Title
Bounds On Powerful Alliance Numbers
Keywords
Defensive alliances; Domination; Extremal graphs; Global alliances; Offensive alliances; Powerful alliances
Abstract
Let G = (V, E) be a graph. Then S ⊆ V is an excess-t global powerful alliance if |N[v] ∩ S| ≥ \N[v] ∩ (V - S)| + t for every v ∈ 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.
Publication Date
7-1-2008
Publication Title
Ars Combinatoria
Volume
88
Number of Pages
135-159
Document Type
Article
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
47949107078 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/47949107078
STARS Citation
Brigham, Robert C. and Button, Ronald D., "Bounds On Powerful Alliance Numbers" (2008). Scopus Export 2000s. 9828.
https://stars.library.ucf.edu/scopus2000/9828
COinS