Acyclic Digraphs and Eigenvalues of (0,1)-Matrices
Combinatorics
2014-09-17 v1
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.
Cite
@article{arxiv.math/0310423,
title = {Acyclic Digraphs and Eigenvalues of (0,1)-Matrices},
author = {Brendan D. McKay and Frederique E. Oggier and Gordon F. Royle and N. J. A. Sloane and Ian M. Wanless and Herbert S. Wilf},
journal= {arXiv preprint arXiv:math/0310423},
year = {2014}
}
Comments
4 pages