Highly Influential

@article{Hammack2014ZeroDA, title={Zero Divisors Among Digraphs}, author={Richard Hammack and Heather Smith}, journal={Graphs and Combinatorics}, year={2014}, volume={30}, pages={171-181} }

- Published 2014 in Graphs and Combinatorics
DOI:10.1007/s00373-012-1248-x

A digraph C is called a zero divisor if there exist non-isomorphic digraphs A and B for which A ×C ∼= B ×C , where the operation is the direct product. In other words, C being a zero divisor means that cancellation property A×C ∼= B×C ⇒ A ∼= B fails. Lovász proved that C is a zero divisor if and only if it admits a homomorphism into a disjoint union of… CONTINUE READING

### Presentations referencing similar topics