Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: hull set

Sortuj według:

Ogranicz wyniki do:

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

On graphs with a unique minimum hull set

100%

Chartrand G., Zhang P.

Discussiones Mathematicae Graph Theory

2001

tom 21

nr 1

31-42

We show that for every integer k ≥ 2 and every k graphs G₁,G₂,...,Gₖ, there exists a hull graph with k hull vertices v₁,v₂,...,vₖ such that link $L(v_i) = G_i$ for 1 ≤ i ≤ k. Moreover, every pair a, b of integers with 2 ≤ a ≤ b is realizable as the hull number and geodetic number (or upper geodetic number) of a hull graph. We also show that every pair a,b of integers with a ≥ 2 and b ≥ 0 is realizable as the hull number and forcing geodetic number of a hull graph.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Chartrand G.

1 Zhang P.

1 2001

Wyniki wyszukiwania

On graphs with a unique minimum hull set