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

Brendan D. McKay; Frederique E. Oggier; Gordon F. Royle; Herbert S. Wilf; Ian M. Wanless; N. J. A. Sloane

arxiv: math/0310423 · v1 · pith:B5BTBZIInew · submitted 2003-10-28 · 🧮 math.CO

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

Brendan D. McKay , Frederique E. Oggier , Gordon F. Royle , N. J. A. Sloane , Ian M. Wanless , Herbert S. Wilf This is my paper

classification 🧮 math.CO

keywords acycliceigenvaluesmatricesnumberdigraphsdirectedequalgraphs

0 comments

read the original 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.

This paper has not been read by Pith yet.

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

discussion (0)