On graphs with a unique minimum hull set | Zendy

Gary Chartrand | Zendy; Ping Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On graphs with a unique minimum hull set

Author(s) -

Gary Chartrand,

Ping Zhang

Publication year - 2001

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.1131

Subject(s) - mathematics , combinatorics , hull , set (abstract data type) , discrete mathematics , computer science , marine engineering , engineering , programming language

We show that for every integer k ‚ 2 and every k graphs G1; G2;:::;Gk, there exists a hull graph with k hull vertices v1;v2;:::;vk such that link L(vi) = Gi for 1 • ik. Moreover, every pair a;b of integers with 2 • ab 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.

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