| Article ID: | iaor1993634 |
| Country: | Netherlands |
| Volume: | 37/38 |
| Issue: | 1/5 |
| Start Page Number: | 525 |
| End Page Number: | 538 |
| Publication Date: | Jul 1992 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Villar J.L. |
The recovery of a line digraph from its underlying graph is considered in this paper. The location of loops and digons are determined, and save for a few exceptions, the solution is unique up to converses. The relation between the automorphism groups of a line digraph and its underlying graph follows as a corollary. The results are applied to de Bruijn and Kautz digraphs.