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

Gordon Royle, B.D. Mckay, F.E. Oggier, N.J.A. Sloane, I.M. Wanless, H.S. Wilf

Research output: Contribution to journalArticle

18 Citations (Scopus)


We show that the number of acyclic directed graphs with n labeled vertices is equalto the number of n £ n (0; 1){matrices whose eigenvalues are positive real numbers.
Original languageEnglish
Pages (from-to)online - approx 5-20pp
JournalJournal of Integer Sequences
Issue number3
Publication statusPublished - 2004

Fingerprint Dive into the research topics of 'Acyclic Digraphs and Eigenvalues of (0,1) - Matrices'. Together they form a unique fingerprint.

  • Cite this

    Royle, G., Mckay, B. D., Oggier, F. E., Sloane, N. J. A., Wanless, I. M., & Wilf, H. S. (2004). Acyclic Digraphs and Eigenvalues of (0,1) - Matrices. Journal of Integer Sequences, 7(3), online - approx 5-20pp.