Acyclic Digraphs and Eigenvalues of (0,1)-Matrices

Abstract

We show that the number of acyclic directed graphs with n labeled vertices is equal to the number of n X n (0,1)-matrices whose eigenvalues are positive real numbers.

4 pages

Cited by in corpus (2)

• Uniform random generation of large acyclic digraphs
• Hiring Strategies