Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.endm.2013.10.032 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Graph convexity,P3 convexity,hull sets,Carathéodory number | Orthogonal convex hull,Discrete mathematics,Graph,Combinatorics,Convexity,Bound graph,Convex hull,Convex set,Regular polygon,Hull,Mathematics | Journal |
Volume | ISSN | Citations |
44 | 1571-0653 | 3 |
PageRank | References | Authors |
0.41 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rommel M. Barbosa | 1 | 36 | 7.33 |
| Dieter Rautenbach | 2 | 946 | 138.87 |
| Vinícius Fernandes dos Santos | 3 | 25 | 10.47 |
| Jayme Luiz Szwarcfiter | 4 | 618 | 95.79 |