Acyclic digraphs and eigenvalues of (0, 1)-matrices

Brendan D. McKay, Prédérique E. Oggier, Gordon F. Royle, N. J.A. Sloane*, Ian M. Wanless, Herbert S. Wilf

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    26 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    JournalJournal of Integer Sequences
    Volume7
    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