Title

Powerful Alliances In Graphs

Keywords

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

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. © 2008 Elsevier B.V. All rights reserved.

Publication Date

4-28-2009

Publication Title

Discrete Mathematics

Volume

309

Issue

8

Number of Pages

2140-2147

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.disc.2006.10.026

Socpus ID

62849086823 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/62849086823

This document is currently not available here.

Share

COinS