Abstract
A graph convexity (G,C) is a graph G together with a collection C of subsets of V(G), called convex sets, such that ∅,V(G)∈C and C is closed under intersections. For a set U⊆V(G), the hull of U, denoted H(U), is the smallest convex set containing U. If H(U)=V(G), then U is a hull set of G. Motivated by the theory of well covered graphs, which investigates the relation between maximal and maximum independent sets of a graph, we study the relation between minimal and minimum hull sets. We concentrate on the P3 convexity, where convex sets are closed under adding common neighbors of their elements.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
