Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Acyclic Digraphs and Eigenvalues of O,1 Matrices

Thumbnail Image

Date

2004

Authors

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

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

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.

Description

Keywords

Keywords: Asymptotic stability; Eigenvalues and eigenfunctions; Matrix algebra; Number theory; Problem solving; Theorem proving; Acyclic digraphs; Arithmetic means; Geometric means; Permutation matrices; Graph theory (0, 1)-matrix; Acyclic; Digraph; Eigenvalue

Citation

URI

http://hdl.handle.net/1885/82870

Collections

ANU Research Publications

Source

Journal of Integer Sequences

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

DSpace software copyright © 2002-2026 LYRASIS

abcd