Skip to main content
Log in

Graphs with a Minimal Number of Convex Sets

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Let G be a graph with vertex set V(G). A set C of vertices of G is g-convex if for every pair \({u, v \in C}\) the vertices on every uv geodesic (i.e. shortest uv path) belong to C. If the only g-convex sets of G are the empty set, V(G), all singletons and all edges, then G is called a g-minimal graph. It is shown that a graph is g-minimal if and only if it is triangle-free and if it has the property that the convex hull of every pair of non-adjacent vertices is V(G). Several properties of g-minimal graphs are established and it is shown that every triangle-free graph is an induced subgraph of a g-minimal graph. Recursive constructions of g-minimal graphs are described and bounds for the number of edges in these graphs are given. It is shown that the roots of the generating polynomials of the number of g-convex sets of each size of a g-minimal graphs are bounded, in contrast to their behaviour over all graphs. A set C of vertices of a graph is m-convex if for every pair \({u, v \in C}\) , the vertices of every induced uv path belong to C. A graph is m-minimal if it has no m-convex sets other than the empty set, the singletons, the edges and the entire vertex set. Sharp bounds on the number of edges in these graphs are given and graphs that are m-minimal are shown to be precisely the 2-connected, triangle-free graphs for which no pair of adjacent vertices forms a vertex cut-set.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beraha S., Kahane J., Weiss N.: Limits of zeros of recursively defined families of polynomials. In: Rota, G. (ed.) Studies in Foundations and Combinatorics., pp. 213–232. Academic Press, New York (1978)

    Google Scholar 

  2. Brown J.I., Colbourn C.J.: On the log concavity of reliability and matroidal sequences. Adv. Appl. Math. 15, 114–127 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brown J.I., Hickman C.A., Sokal A.D., Wagner D.G.: On the chromatic roots of generalized theta graphs. J. Combin. Theory B. 83, 272–297 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brown J.I., Nowakowski R.J.: Bounding the roots of independence polynomials. Ars Combin. 58, 113–120 (2001)

    MathSciNet  MATH  Google Scholar 

  5. Brown J.I., Hickman C.A.: On chromatic roots of large subdivisions of graphs. Discret. Math. 242, 17–30 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brown J.I., Hickman C.A., Nowakowski R.J.: On the location of roots of independence polynomials. Algebr. Comb. 19, 273–282 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Brown J.I., Hickman C.A., Thomas H.R., Wagner D.G.: Bounding the roots of ideal and open set polynomials. Ann. Comb. 9, 259–268 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cáceres J., Oellermann O.R., Puertas M.L.: Minimal trees and convex geometries. Discuss. Math. Graph Theory. 32, 685–704 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chartrand G., Harary F., Zhang P.: On the hull number of a graph. Ars Comb. 57, 129–138 (2000)

    MathSciNet  MATH  Google Scholar 

  10. Chartrand G., Wall C.E., Zhang P.: The convexity number of a graph. Graphs Comb. 18, 209–217 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Chartrand G., Zhang P.: On graphs with a unique minimum hull set. Discuss. Math. Graph Theory 21, 31–42 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Chudnovsky M., Seymour P.: The roots of independence polynomials of a claw-free graph. J. Combin. Theory Ser. B 97, 350–357 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Comtet L.: Advanced Combinatorics. Reidel Pub. Co., Boston (1974)

    Book  MATH  Google Scholar 

  14. Dourado M.C., Gimbel J.G., Kratochvíl J., Protti F., Szwarcfiter J.: On the computation of the hull number of a graph. Discret. Math 309, 5668–5674 (2009)

    Article  MATH  Google Scholar 

  15. Dourado M.C., Protti F., Rautenbach D., Szwarcfiter J.: On the hull number of triangle-free graphs. SIAM J. Discret. Math. 23, 2163–2172 (2010)

    Article  MathSciNet  Google Scholar 

  16. Dourado M.C., Protti F., Rautenbach D., Szwarcfiter J.L.: On the convexity number of a graphs. Graph Comb. 28, 333–345 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Dourado M.C., Protti F., Szwarcfiter J.L.: Complexity results related to monophonic convexity. Discr. Appl. Math. 158, 1268–1274 (2012)

    Article  MathSciNet  Google Scholar 

  18. Hebbare, S.P.R.: Two decades survey of geodesic convexity in graphs. In: Proceedings of the Symposium on Graph Theory and Combinatorics, vol. 21, pp. 119–153 (1991)

  19. Dragan F.F., Nicolai F., Brandstädt A.: Convexity and HHD-free graphs. SIAM J. Discret. Math. 12, 119–135 (1999)

    Article  MATH  Google Scholar 

  20. Everett M.G., Seidman S.B.: The hull number of a graph. Discret. Math. 57, 217–223 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  21. Farber M., Jamison R.E.: Convexity in graphs and hypergraphs. SIAM J. Alg. Discret. Meth. 7, 433–444 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  22. Fisher D.C., Solow A.E.: Dependence polynomials. Discret. Math. 82, 251–258 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  23. Heilmann O.J., Lieb E.H.: Theory of monomer–dimer systems. Commun. Math. Phys. 25, 190–232 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  24. Hernando C., Jiang T., Mora M., Pelayo I.M., Seara C.: On the Steiner, geodetic and hull numbers of a graph. Discret. Math. 293, 139–154 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  25. Nielsen M., Oellermann O.R.: Steiner trees and convex geometries. SIAM J. Discret. Math. 23, 680–693 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  26. Soltan V.P.: d-convexity in graphs. Sov. Dokl. 28, 419–421 (1983)

    MATH  Google Scholar 

  27. Soltan V.P., Chepoi V.P.: Number of d-convex sets in graph (Russian). Izu. Akad. Nauk. Moldav. SSR. Ser Fiz. Tekn. Mat. Nauk. 78, 19–23 (1984)

    MathSciNet  Google Scholar 

  28. Van de Vel M.J.L.: Theory of Convex Structures. North-Holland, Amsterdam (1993)

    MATH  Google Scholar 

  29. Wagner D.G.: Zeros of reliability polynomials and f-vectors of matroids. Combin. Probab. Comput. 9, 167–190 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ortrud R. Oellermann.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brown, J., Oellermann, O.R. Graphs with a Minimal Number of Convex Sets. Graphs and Combinatorics 30, 1383–1397 (2014). https://doi.org/10.1007/s00373-013-1356-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-013-1356-2

Keywords

Mathematics Subject Classification (2000)

Navigation