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

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

2003-10-28

arxiv.org/abs/math/0310423v1

Mathematics

Combinatorics

4 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Acyclic Digraphs and Eigenvalues of (0,1)-Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Acyclic Digraphs and Eigenvalues of (0,1)-Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Acyclic Digraphs and Eigenvalues of (0,1)-Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137126