Return to search

Bounds on the Global Offensive K-Alliance Number in Graphs

Let G = (V (G), E(G)) be a graph, and let k ≥ 1 be an integer. A set S ⊆⊆ V (G) is called a global offensive k-alliance if ΙN(ν) ∩ SΙ ≥ ΙN(ν)-SΙ+k for every ν ε V (G)-S, where N(v) is the neighborhood of ν. The global offensive k-alliance number γko(G) is the minimum cardinality of a global o ensive k-alliance in G. We present di erent bounds on γko(G) in terms of order, maximum degree, independence number, chromatic number and minimum degree.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-18541
Date01 January 2009
CreatorsChellali, Mustapha, Haynes, Teresa W., Randerath, Bert, Volkmann, Lutz
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
SourceETSU Faculty Works

Page generated in 0.0018 seconds