Title of article
Powerful alliances in graphs
Author/Authors
Brigham، نويسنده , , Robert C. and Dutton، نويسنده , , Ronald D. and Haynes، نويسنده , , Teresa W. and Hedetniemi، نويسنده , , Stephen T.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
8
From page
2140
To page
2147
Abstract
For a graph G = ( V , E ) , a non-empty set S ⊆ V is a defensive alliance if for every vertex v in S , v has at most one more neighbor in V − S than it has in S , and S is an offensive alliance if for every v ∈ V − S that has a neighbor in S , v has more neighbors in S than in V − S . A powerful alliance is both defensive and offensive. We initiate the study of powerful alliances in graphs.
Keywords
Offensive alliance , alliance , Powerful alliance , Global powerful alliance , domination , defensive alliance
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598682
Link To Document