Spelling suggestions: "subject:"global offensive kalliance number"" "subject:"global offensive alliance number""
1 |
Bounds on the Global Offensive K-Alliance Number in GraphsChellali, Mustapha, Haynes, Teresa W., Randerath, Bert, Volkmann, Lutz 01 January 2009 (has links)
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.
|
Page generated in 0.0579 seconds