Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: extreme hull graph

Sortuj według:

Ogranicz wyniki do:

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

The hull number of strong product graphs

100%

Santhakumaran A., Ullas Chandran S.

Discussiones Mathematicae Graph Theory

2011

tom 31

nr 3

493-507

For a connected graph G with at least two vertices and S a subset of vertices, the convex hull $[S]_G$ is the smallest convex set containing S. The hull number h(G) is the minimum cardinality among the subsets S of V(G) with $[S]_G = V(G)$. Upper bound for the hull number of strong product G ⊠ H of two graphs G and H is obtainted. Improved upper bounds are obtained for some class of strong product graphs. Exact values for the hull number of some special classes of strong product graphs are obtained. Graphs G and H for which h(G⊠ H) = h(G)h(H) are characterized.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Santhakumaran A.

1 Ullas Chandran S.

1 2011

Wyniki wyszukiwania

The hull number of strong product graphs