Powerful alliances in graphs

    Authors

    R. C. Brigham; R. D. Dutton; T. W. Haynes;S. T. Hedetniemi

    Comments

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

    Abbreviated Journal Title

    Discret. Math.

    Keywords

    Alliance; Defensive alliance; Offensive alliance; Powerful alliance; Global powerful alliance; Domination; NUMBERS; Mathematics

    Abstract

    For a graph G = (V, E). a non-empty set S subset of 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 is an element of 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. (C) 2008 Elsevier B.V. All rights reserved.

    Journal Title

    Discrete Mathematics

    Volume

    309

    Issue/Number

    8

    Publication Date

    1-1-2009

    Document Type

    Article

    Language

    English

    First Page

    2140

    Last Page

    2147

    WOS Identifier

    WOS:000265176000021

    ISSN

    0012-365X

    Share

    COinS