| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653866 | European Journal of Combinatorics | 2013 | 13 Pages |
Abstract
We use a construction called the factorial A! of a digraph A. Given digraphs A and C, the digraph A! carries information that determines the complete set of solutions X to the digraph equation AÃCâ
XÃC. We state the exact conditions under which there is only one solution X (namely Xâ
A) and that is the situation in which cancellation holds.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Richard H. Hammack,