Skip to main content
SpringerLink
Log in

Convex Sets in Lexicographic Products of Graphs

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

Abstract

Geodesic convex sets, Steiner convex sets, and J-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies Theorem 3.1 in Canoy and Garces (Graphs Combin 18(4):787–793, 2002).

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

Access this article

Log in via an institution

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. Balakrishnan, K., Changat, M.: Hull numbers of path convexities on graphs. In: Convexity in Discrete Structures, vol. 5. Ramanujan Mathematical Society Lecture Notes Series, pp. 11–23. Ramanujan Mathematical Society, Mysore (2008)

  2. Bandelt, H.-J., Chepoi, V.: Metric graph theory and geometry: a survey. In: Surveys on Discrete and Computational Geometry, vol. 453. Contemp. Math., pp. 49–86. American Mathematical Society, Providence (2008)

  3. Brešar B., Changat M., Mathews J., Peterin I., Narasimha-Shenoi P.G., Tepeh Horvat A.: Steiner intervals, geodesic intervals, and betweenness. Discrete Math. 309(20), 6114–6125 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. Canoy S.R. Jr, Garces I.J.L.: Convex sets under some graph operations. Graphs Combin. 18(4), 787–793 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Changat, M., Klavžar, S., Mulder, H.M.: The all-paths transit function of a graph. Czechoslovak Math. J. 51(126)(2), 439–448 (2001)

    Google Scholar 

  6. Changat, M., Klavžar, S., Mulder, H.M., Vijayakumar, A. (eds.): Convexity in Discrete Structures, vol. 5. Ramanujan Mathematical Society Lecture Notes Series. Ramanujan Mathematical Society, Mysore (2008)

  7. Changat M., Mathew J.: Induced path transit function, monotone and Peano axioms. Discrete Math. 286(3), 185–194 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Changat, M., Mathews, J.: Characterizations of J-monotone graphs. In: Convexity in Discrete Structures, vol. 5. Ramanujan Mathematical Society Lecture Notes Series, pp. 47–55. Ramanujan Mathematical Society, Mysore (2008)

  9. Changat M., Mathews J., Peterin I., Narasimha-Shenoi P.G.: n-ary transit functions in graphs. Discuss. Math. Graph Theory 30(4), 671–686 (2010)

    MATH  MathSciNet  Google Scholar 

  10. Changat M., Mulder H.M., Sierksma G.: Convexities related to path properties on graphs. Discrete Math. 290(2-3), 117–131 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Dorbec P., Mollard M., Klavžar S., Špacapan S.: Power domination in product graphs. SIAM J. Discrete Math. 22(2), 554–567 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Duchet P.: Convex sets in graphs. II. Minimal path convexity. J. Combin. Theory Ser. B 44(3), 307–316 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hernando C., Jiang T., Mora M., Pelayo I.M., Seara C.: On the Steiner, geodetic and hull numbers of graphs. Discrete Math. 293(1–3), 139–154 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ille P.: A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product. Discrete Math. 309(11), 3518–3522 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  15. Imrich W., Klavžar S.: Product Graphs. Wiley-Interscience, New York (2000)

    MATH  Google Scholar 

  16. Jaradat M.M.M.: Minimal cycle bases of the lexicographic product of graphs. Discuss. Math. Graph Theory 28(2), 229–247 (2008)

    MATH  MathSciNet  Google Scholar 

  17. Kubicka E., Kubicki G., Oellermann O.R.: Steiner intervals in graphs. Discrete Appl. Math. 81(1–3), 181–190 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  18. Morgana M.A., Mulder H.M.: The induced path convexity, betweenness, and svelte graphs. Discrete Math. 254(1–3), 349–370 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  19. Mulder, H.M.: The Interval Function of a Graph, vol. 132. Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam (1980)

  20. Nowakowski R.J., Seyffarth K.: Small cycle double covers of products. I. Lexicographic product with paths and cycles. J. Graph Theory 57(2), 99–123 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  21. Oellermann O.R., Puertas M.L.: Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. Discrete Math. 307(1), 88–96 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Zheng Y., Zhang Z., Aygul M.: Nowhere-zero flows in lexicographic product of graphs. J. Math. Study 42(1), 30–35 (2009)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Futures Studies, University of Kerala, Trivandrum, 695034, India

    Bijo S. Anand & Manoj Changat

  2. Faculty of Mathematics and Physics, University of Ljubljana, Ljubljana, Slovenia

    Sandi Klavžar

  3. Faculty of Natural Sciences and Mathematics, University of Maribor, Maribor, Slovenia

    Sandi Klavžar

  4. Institute of Mathematics and Physics, FEECS, University of Maribor, Maribor, Slovenia

    Iztok Peterin

Authors
  1. Bijo S. Anand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manoj Changat
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sandi Klavžar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Iztok Peterin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bijo S. Anand.

Additional information

S. Klavžar and I. Peterin supported by the Ministry of Science of Slovenia under the grant P1-0297.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anand, B.S., Changat, M., Klavžar, S. et al. Convex Sets in Lexicographic Products of Graphs. Graphs and Combinatorics 28, 77–84 (2012). https://doi.org/10.1007/s00373-011-1031-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-011-1031-4

Keywords

Mathematics Subject Classification (2010)

Search

Navigation