Abstract | ||
---|---|---|
Let G be a finite, simple, and undirected graph and let S be a set of vertices of G. If no vertex of G that does not belong to S has two neighbours in S, then S is P3-convex. The P3-convex hull HG(S) of S is the smallest P3-convex set containing S. The P3-Carathéodory number of G is the smallest integer c such that for every set S and every vertex u in HG(S), there is a set F⊆S with |F|⩽c and u∈HG(F). |
Year | DOI | Venue |
---|---|---|
2012 | 10.1016/j.endm.2011.09.018 | Electronic Notes in Discrete Mathematics |
Keywords | DocType | Volume |
Convexity space,graph,geodetic convexity,monophonic convexity,P3 convexity,Carathéodory number | Journal | 38 |
Issue | ISSN | Citations |
3 | 1571-0653 | 6 |
PageRank | References | Authors |
0.58 | 10 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rommel M. Barbosa | 1 | 36 | 7.33 |
Erika M. M. Coelho | 2 | 15 | 5.27 |
Mitre Dourado | 3 | 90 | 18.43 |
Dieter Rautenbach | 4 | 946 | 138.87 |
Jayme Luiz Szwarcfiter | 5 | 618 | 95.79 |