Skip to main content
SpringerLink
Log in

Digraphs Products

  • Chapter
  • First Online:
Classes of Directed Graphs

Part of the book series: Springer Monographs in Mathematics ((SMM))

Abstract

This chapter is a survey of the four standard associative digraph products, namely the Cartesian, strong, direct and lexicographic products. Topics include metric properties, connectedness, hamiltonian properties and invariants. Special attention is given to issues of cancellation and unique prime factorization.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 89.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. N. R. Aravind, N. Narayanan, and C.R. Subramanian. Oriented colouring of some graph products. Discuss. Math. Graph Theory, 31(4):675–686, 2011.

    Article  MathSciNet  Google Scholar 

  2. S. Bessy and S. Thomassé. The categorical product of two 5-chromatic digraphs can be 3-chromatic. Discrete Math., 305(1-3):344–346, 2005.

    Article  MathSciNet  Google Scholar 

  3. V.D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. Van Dooren. A measure of similarity between graph vertices: applications to synonym extraction and web searching. SIAM Rev., 46(4):647–666, 2004.

    Article  MathSciNet  Google Scholar 

  4. J.A. Bondy, X. Buchwalder, and F. Mercier. Lexicographic products and a conjecture of Hahn and Jackson. SIAM J. Discrete Math., 23(2):882–887, 2009.

    Article  MathSciNet  Google Scholar 

  5. S. Chen and X. Chen. Weak connectedness of tensor product of digraphs. Discrete Appl. Math., 185:52–58, 2015.

    Article  MathSciNet  Google Scholar 

  6. C. Crespelle and E. Thierry. Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time. Discrete Math., 338(12):2393–2407, 2015.

    Article  MathSciNet  Google Scholar 

  7. L.J. Culp and R. Hammack. An isomorphism theorem for digraphs. Australas. J. Combin., 48:205–211, 2010.

    MathSciNet  MATH  Google Scholar 

  8. W. Dörfler and W. Imrich. Das lexikographische Produkt gerichteter Graphen. Monatsh. Math., 76:21–30, 1972.

    Article  MathSciNet  Google Scholar 

  9. J. Feigenbaum. Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time. Discrete Appl. Math., 15(1):105–110, 1986.

    Article  MathSciNet  Google Scholar 

  10. G. Fertin, A. Raspaud, and A. Roychowdhury. On the oriented chromatic number of grids. Inform. Process. Lett., 85(5):261–266, 2003.

    Article  MathSciNet  Google Scholar 

  11. J. Fox and B. Sudakov. Paths and stability number in digraphs. Elec. J. Combin., 16(1):Note 23, 4, 2009.

    Google Scholar 

  12. T. Gallai and A.N. Milgram. Verallgemeinerung eines graphentheoretischen Satzes von Rédei. Acta Sci. Math. Szeged, 21:181–186, 1960.

    MathSciNet  MATH  Google Scholar 

  13. M.R. Garey and D.S. Johnson. Computers and intractability. W. H. Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  14. G. Hahn and B. Jackson. A note concerning paths and independence number in digraphs. Discrete Math., 82(3):327–329, 1990.

    Article  MathSciNet  Google Scholar 

  15. R. Hammack. Cancellation of digraphs over the direct product. European J. Combin., 34(5):846–858, 2013.

    Article  MathSciNet  Google Scholar 

  16. R. Hammack and W. Imrich. On Cartesian skeletons of graphs. Ars Math. Contemp., 2(2):191–205, 2009.

    MathSciNet  MATH  Google Scholar 

  17. R. Hammack and W. Imrich. Unique prime factorization of digraphs over the direct product. preprint, 2017.

    Google Scholar 

  18. R. Hammack, W. Imrich, and S. Klavžar. Handbook of Product Graphs. Discrete Mathematics and its Applications (Boca Raton). CRC Press, Boca Raton, FL, second edition, 2011. With a foreword by Peter Winkler.

    Google Scholar 

  19. R. Hammack and H. Smith. Zero divisors among digraphs. Graphs Combin., 30(1):171–181, 2014.

    Article  MathSciNet  Google Scholar 

  20. R. Hammack and K.E. Toman. Cancellation of direct products of digraphs. Discuss. Math. Graph Theory, 30(4):575–590, 2010.

    Article  MathSciNet  Google Scholar 

  21. F. Harary and C.A. Trauth, Jr. Connectedness of products of two directed graphs. SIAM J. Appl. Math., 14:250–254, 1966.

    Article  MathSciNet  Google Scholar 

  22. D.J. Hartfiel and C.J. Maxson. The chainable matrix, a special combinatorial matrix. Discrete Math., 12:245–256, 1975.

    Article  MathSciNet  Google Scholar 

  23. P. Hell and J. Nešetřil. Graphs and Homomorphisms. Oxford Univ. Press, Oxford, 2004.

    Book  Google Scholar 

  24. M. Hellmuth and T. Marc. On the Cartesian skeleton and the factorization of the strong product of digraphs. Theoret. Comput. Sci., 565:16–29, 2015.

    Article  MathSciNet  Google Scholar 

  25. W. Imrich, S. Klavžar, and D. F. Rall. Topics in Graph Theory: Graphs and their Cartesian Product. A K Peters, Ltd., Wellesley, MA, 2008.

    MATH  Google Scholar 

  26. W. Imrich and W. Klöckl. Factoring directed graphs with respect to the cardinal product in polynomial time. Discuss. Math. Graph Theory, 27(3):593–601, 2007.

    Article  MathSciNet  Google Scholar 

  27. W. Imrich and W. Klöckl. Factoring directed graphs with respect to the cardinal product in polynomial time II. Discuss. Math. Graph Theory, 30(3):461–474, 2010.

    Article  MathSciNet  Google Scholar 

  28. K. Keating. Multiple-ply Hamiltonian graphs and digraphs. In Cycles in graphs (Burnaby, B.C., 1982), volume 115 of North-Holland Math. Stud., pages 81–87. North-Holland, Amsterdam, 1985.

    Google Scholar 

  29. B.M. Kim, B.C. Song, and W. Hwang. Exponents and diameters of strong products of digraphs. Elec. J. Linear Algebra, 22:1106–1111, 2011.

    Article  MathSciNet  Google Scholar 

  30. B.M. Kim, B.C. Song, and W. Hwang. The exponent of Cartesian product of cycles. Appl. Math. Lett., 22(4):561–564, 2009.

    Article  MathSciNet  Google Scholar 

  31. B.M. Kim, B.C. Song, and W. Hwang. The exponent of a digraph and the diameter of its multiple direct product. Linear Algebra Appl., 437(10):2601–2612, 2012.

    Article  MathSciNet  Google Scholar 

  32. B.M. Kim, B.C. Song, and W. Hwang. Wielandt type theorem for Cartesian product of digraphs. Linear Algebra Appl., 429(4):841–848, 2008.

    Article  MathSciNet  Google Scholar 

  33. M. Kwaśnik. \((k,l)\)-kernels in graphs and their products. PhD thesis, Wrocław, 1980.

    Google Scholar 

  34. L. Lakshmi and Vidhyapriya. Kernels in Cartesian products of digraphs. Australas. J. Combin., 66(2):229–239, 2016.

    Google Scholar 

  35. J. Liu, X. Zhang, and J. Meng. On domination number of Cartesian product of directed paths. J. Comb. Optim., 22(4):651–662, 2011.

    Article  MathSciNet  Google Scholar 

  36. L. Lovász. On the cancellation law among finite relational structures. Period. Math. Hungar., 1(2):145–156, 1971.

    Article  MathSciNet  Google Scholar 

  37. M.H. McAndrew. On the product of directed graphs. Proc. Amer. Math. Soc., 14:600–606, 1963.

    Article  MathSciNet  Google Scholar 

  38. R. McKenzie. Cardinal multiplication of structures with a reflexive relation. Fund. Math., 70(1):59–101, 1971.

    Article  MathSciNet  Google Scholar 

  39. L.L. Ng. Hamiltonian decomposition of lexicographic products of digraphs. J. Combin. Theory Ser. B, 73(2):119–129, 1998.

    Article  MathSciNet  Google Scholar 

  40. M. Norge, P. Labarr, B. Sanders, and D. Taylor. Kings in products of digraphs. preprint, 2017.

    Google Scholar 

  41. P. Paulraja and S. Sivasankar. Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs. Graphs Combin., 25(4):571–581, 2009.

    Article  MathSciNet  Google Scholar 

  42. S. Poljak. Coloring digraphs by iterated antichains. Comment. Math. Univ. Carolin., 32(2):209–212, 1991.

    MathSciNet  MATH  Google Scholar 

  43. S. Poljak and V. Rödl. On the arc-chromatic number of a digraph. J. Combin. Theory Ser. B, 31(2):190–198, 1981.

    Article  MathSciNet  Google Scholar 

  44. G. Schaar, M. Sonntag, and H.-M. Teichert. Hamiltonian properties of products of graphs and digraphs, volume 108 of Teubner-Texte zur Mathematik [Teubner Texts in Mathematics]. BSB B. G. Teubner Verlagsgesellschaft, Leipzig, 1988. With German, French and Russian summaries.

    Google Scholar 

  45. R. Shaheen. Domination number of toroidal grid digraphs. Util. Math., 78:175–184, 2009.

    MathSciNet  MATH  Google Scholar 

  46. R. Shaheen. On the domination number of Cartesian products of two directed paths. Intern. J. Contemp. Math. Sci., 7(33-36):1785–1790, 2012.

    MathSciNet  MATH  Google Scholar 

  47. R. Shaheen. Total domination number of products of two directed cycles. Util. Math., 92:235–250, 2013.

    MathSciNet  MATH  Google Scholar 

  48. R. Shaheen. Total domination number of strong products of directed cycles. Util. Math., 99:89–100, 2016.

    MathSciNet  MATH  Google Scholar 

  49. M. Sonntag and H.-M. Teichert. Competition hypergraphs of products of digraphs. Graphs Combin., 25(4):611–624, 2009.

    Article  MathSciNet  Google Scholar 

  50. M. Sonntag and H.-M. Teichert. Products of digraphs and their competition graphs. Discuss. Math. Graph Theory, 36(1):43–58, 2016.

    Article  MathSciNet  Google Scholar 

  51. E. Sopena. Oriented graph coloring. Discrete Math., 229(1-3):359–369, 2001. Combinatorics, graph theory, algorithms and applications.

    Article  MathSciNet  Google Scholar 

  52. R. Stong. Hamilton decompositions of directed cubes and products. Discrete Math., 306(18):2186–2204, 2006.

    Article  MathSciNet  Google Scholar 

  53. A. Szepietowski and M. Targan. A note on the oriented chromatic number of grids. Inform. Process. Lett., 92(2):65–70, 2004.

    Article  MathSciNet  Google Scholar 

  54. W. Szumny, A. Włoch, and I. Włoch. On \((k,l)\)-kernels in \(D\)-join of digraphs. Discuss. Math. Graph Theory, 27(3):457–470, 2007.

    Article  MathSciNet  Google Scholar 

  55. C. Tardif. Chromatic numbers of products of tournaments: fractional aspects of Hedetniemi’s conjecture. In Graphs, morphisms and statistical physics, volume 63 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 171–175. Amer. Math. Soc., Providence, RI, 2004.

    Google Scholar 

  56. C. Tardif and D. Wehlau. Chromatic numbers of products of graphs: the directed and undirected versions of the Poljak-Rödl function. J. Graph Theory, 51(1):33–36, 2006.

    Article  MathSciNet  Google Scholar 

  57. W.T. Trotter, Jr. and P. Erdős. When the Cartesian product of directed cycles is Hamiltonian. J. Graph Theory, 2(2):137–142, 1978.

    Article  MathSciNet  Google Scholar 

  58. H. Wielandt. Unzerlegbare, nicht negative Matrizen. Math. Z., 52:642–648, 1950.

    Article  MathSciNet  Google Scholar 

  59. A. Włoch and I. Włoch. On \((k,l)\)-kernels in generalized products. Discrete Math., 164(1-3):295–301, 1997. The Second Krakow Conference on Graph Theory (Zgorzelisko, 1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Applied Mathematics, Virginia Commonwealth University, P.O. Box 842014, Richmond, VA, USA

    Richard H. Hammack

Authors
  1. Richard H. Hammack
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Richard H. Hammack .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark

    Jørgen Bang-Jensen

  2. Department of Computer Science, Royal Holloway, University of London, Egham, United Kingdom

    Gregory Gutin

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Hammack, R.H. (2018). Digraphs Products. In: Bang-Jensen, J., Gutin, G. (eds) Classes of Directed Graphs. Springer Monographs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-71840-8_10

Download citation

Publish with us

Policies and ethics

Search

Navigation