Skip navigation
Skip navigation

Acyclic Digraphs and Eigenvalues of O,1 Matrices

McKay, Brendan; Oggier, Frederique; Royle, Gordon; Sloane, N J A; Wanless, Ian; Wilf, Herbert

Description

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.

CollectionsANU Research Publications
Date published: 2004
Type: Journal article
URI: http://hdl.handle.net/1885/82870
Source: Journal of Integer Sequences

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator