Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: signed 2-independence number

Sortuj według:

Ogranicz wyniki do:

Bounds on the Signed 2-Independence Number in Graphs

100%

Volkmann L.

Discussiones Mathematicae Graph Theory

2013

tom 33

nr 4

709-715

Let G be a finite and simple graph with vertex set V (G), and let f V (G) → {−1, 1} be a two-valued function. If ∑x∈N|v| f(x) ≤ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v, then f is a signed 2-independence function on G. The weight of a signed 2-independence function f is w(f) =∑v∈V (G) f(v). The maximum of weights w(f), taken over all signed 2-independence functions f on G, is the signed 2-independence number α2s(G) of G. In this work, we mainly present upper bounds on α2s(G), as for example α2s(G) ≤ n−2 [∆ (G)/2], and we prove the Nordhaus-Gaddum type inequality α2s (G) + α2s(G) ≤ n+1, where n is the order and ∆ (G) is the maximum degree of the graph G. Some of our theorems improve well-known results on the signed 2-independence number.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Volkmann L.

1 2013

Wyniki wyszukiwania

Bounds on the Signed 2-Independence Number in Graphs