Skip to main content

Zero Divisors Among Digraphs

Abstract

A digraph C is called a zero divisor if there exist non-isomorphic digraphs A and B for which \({A \times C \cong B \times C}\) , where the operation is the direct product. In other words, C being a zero divisor means that cancellation property \({A \times C \cong B \times C \Rightarrow A \cong B}\) fails. Lovász proved that C is a zero divisor if and only if it admits a homomorphism into a disjoint union of directed cycles of prime lengths.Thus any digraph C that is homomorphically equivalent to a directed cycle (or path) is a zero divisor. Given such a zero divisor C and an arbitrary digraph A, we present a method of computing all solutions X to the digraph equation \({A \times C \cong X \times C}\) .

This is a preview of subscription content, access via your institution.

References

  1. Hammack R.: On direct product cancellation of graphs. Discret. Math. 309, 2538–2543 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Hammack R., Toman K.: Cancellation of direct products of digraphs. Discusiones Mathematicae Graph Theory 30, 575–590 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. Hammack R. Imrich W. and Klavžar S. (2011) Handbook of Product Graphs, 2nd edn. Discrete Mathematics and its applications, CRC Press/Taylor and Francis, Boca Raton

  4. Hell P., Nešetřil J.: Graphs and Homomorphisms. Oxford Lecture Series in Mathematics. Oxford University Press, Oxford (2004)

    Book  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Richard Hammack.

Additional information

This work extends and generalizes some earlier results by R. Hammack and K. Toman [Cancellation of direct products of digraphs, Discusiones Mathematicae Graph Theory, 30 (2010) 575–590].

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Hammack, R., Smith, H. Zero Divisors Among Digraphs. Graphs and Combinatorics 30, 171–181 (2014). https://doi.org/10.1007/s00373-012-1248-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1248-x

Keywords

  • Digraphs
  • Direct product of digraphs
  • Cancellation

Mathematics Subject Classification (2000)

  • 05C76