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 - 1 Jan 2004 |
Externally published | Yes |
Keywords
- (0, 1)-matrix
- Acyclic
- Digraph
- Eigenvalue