Cancellation of direct products of digraphs
Author(s) -
Richard H. Hammack,
Katherine E. Toman
Publication year - 2010
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1515
Subject(s) - digraph , homomorphism , mathematics , combinatorics , arc (geometry) , discrete mathematics , geometry
We investigate expressions of form A×C ∼= B×C involving direct products of digraphs. Lovasz gave exact conditions on C for which it necessarily follows that A ∼= B. We are here concerned with a different aspect of cancellation. We describe exact conditions on A for which it necessarily follows that A ∼= B. In the process, we do the following: Given an arbitrary digraph A and a digraph C that admits a homomorphism onto an arc, we classify all digraphs B for which A× C ∼= B × C.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom