Abstract
We show that the number of acyclic directed graphs with n labeled vertices is equal to the number of n × n (0, 1)-matrices whose eigenvalues are positive real numbers.
| Original language | English |
|---|---|
| Journal | Journal of Integer Sequences |
| Volume | 7 |
| Issue number | 3 |
| Publication status | Published - 2004 |
Fingerprint
Dive into the research topics of 'Acyclic digraphs and eigenvalues of (0, 1)-matrices'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver