The hull number of strong product graphs | Zendy

A. P. Santhakumaran | Zendy; Ullas Chandran S.V. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The hull number of strong product graphs

Author(s) -

A. P. Santhakumaran,

Ullas Chandran S.V.

Publication year - 2011

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1560

Subject(s) - mathematics , combinatorics , hull , product (mathematics) , discrete mathematics , geometry , marine engineering , engineering

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. GraphsG andH for which h(G⊠H) = h(G)h(H) are characterized.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research