Acyclic Digraphs and Eigenvalues of O,1 Matrices
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.
|Collections||ANU Research Publications|
|Source:||Journal of Integer Sequences|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.