Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: majority

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Offensive alliances in graphs

100%

Favaron O., Fricke G., Goddard W., Hedetniemi S., Hedetniemi S., Kristiansen P., Laskar R., Skaggs R.

Discussiones Mathematicae Graph Theory

2004

tom 24

nr 2

263-275

A set S is an offensive alliance if for every vertex v in its boundary N(S)- S it holds that the majority of vertices in v's closed neighbourhood are in S. The offensive alliance number is the minimum cardinality of an offensive alliance. In this paper we explore the bounds on the offensive alliance and the strong offensive alliance numbers (where a strict majority is required). In particular, we show that the offensive alliance number is at most 2/3 the order and the strong offensive alliance number is at most 5/6 the order.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Favaron O.

1 Fricke G.

1 Goddard W.

1 Hedetniemi S.

1 Kristiansen P.

1 Laskar R.

1 Skaggs R.

1 2004

Wyniki wyszukiwania

Offensive alliances in graphs