[논문 리뷰] Acyclic Digraphs and Eigenvalues of (0,1)-Matrices

Brendan D. McKay, Frédérique Oggier외 4명|arXiv (Cornell University)|2003. 10. 28.

Graph theory and applicationsMathematics참고 문헌 4인용 수 21

한 줄 요약

이 논문은 $n$개의 레이블이 부여된 방향성 있는 무사이클 그래프의 수가 모든 양의 실수 고유값을 갖는 $n \times n$ $(0,1)$-행렬의 수와 같다는 Weisstein의 추측을 증명한다. 증명은 방향성 있는 무사이클 그래프의 인접행렬 $A$에 대해 $B = I + A$의 변환을 통해 이분법적 대응을 수립하며, 이러한 행렬들은 모두 고유값이 1임을 보이고, 반대로 모든 양의 실수 고유값을 갖는 $(0,1)$-행렬은 반드시 이 형태여야 함을 보인다.

ABSTRACT

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.

연구 동기 및 목표

• To resolve Weisstein's conjecture that the count of acyclic digraphs with $n$ labeled vertices matches the count of $n \times n$ $(0,1)$-matrices with all positive real eigenvalues.
• To establish a structural and spectral correspondence between acyclic digraphs and $(0,1)$-matrices with positive eigenvalues.
• To characterize the eigenvalue behavior of $(0,1)$-matrices derived from directed graphs, particularly focusing on positivity and reality of eigenvalues.
• To explore the implications of this correspondence for matrix theory, graph theory, and combinatorics, including symmetry and equivalence classes.

제안 방법

• Define $A$ as the adjacency matrix of an acyclic digraph $G$, ensuring $A$ has zero diagonal (no loops), so $B = I + A$ is a $(0,1)$-matrix with 1s on the diagonal.
• Use topological sorting to relabel vertices so $A$ becomes strictly upper triangular, making $B = I + A$ upper triangular with 1s on the diagonal, hence all eigenvalues of $B$ are 1.
• Apply the arithmetic-geometric mean inequality to show that if all eigenvalues of a $(0,1)$-matrix $B$ are positive reals, then they must all be equal to 1.
• Use the trace condition $\mathrm{Trace}(B^k) = n$ for all $k$ to show that all closed walks of length $k$ in the digraph of $B$ must be loops, implying no non-loop edges exist.
• Define $A = B - I$, so $A$ is a $(0,1)$-matrix with zero diagonal and no cycles in its associated digraph, proving $A$ corresponds to an acyclic digraph.
• Establish equivalence classes under permutation similarity, showing that the number of such matrices up to permutation is equal to the number of acyclic digraphs on $n$ unlabeled vertices.

실험 결과

연구 질문

• RQ1 Are the sequences counting acyclic digraphs with $n$ labeled vertices and $(0,1)$-matrices with positive real eigenvalues identical?
• RQ2 What spectral properties characterize $(0,1)$-matrices that arise from acyclic digraphs via $B = I + A$?
• RQ3 Can every $(0,1)$-matrix with positive real eigenvalues be shown to be of the form $I + A$ for some acyclic digraph’s adjacency matrix $A$?
• RQ4 What constraints do the trace and determinant of a $(0,1)$-matrix impose on its eigenvalues when they are required to be positive reals?
• RQ5 How does the structure of the digraph (e.g., presence of cycles) affect the nature of the eigenvalues of its adjacency matrix?

주요 결과

• The number of acyclic digraphs with $n$ labeled vertices is exactly equal to the number of $n \times n$ $(0,1)$-matrices with all positive real eigenvalues, confirming Weisstein’s conjecture.
• Any $(0,1)$-matrix with all positive real eigenvalues must have all eigenvalues equal to 1, and its diagonal entries must all be 1.
• The only symmetric $(0,1)$-matrix with positive eigenvalues is the identity matrix.
• A matrix $B$ with integer entries and $\mathrm{Trace}(B) \leq n$ has all eigenvalues real and positive if and only if $B = I + N$ for some nilpotent matrix $N$.
• If a digraph contains a cycle, its adjacency matrix has at least one eigenvalue that is zero, negative, or strictly complex; if the shortest cycle has length at least 3, there is a strictly complex eigenvalue.
• The number of equivalence classes of $n \times n$ $(0,1)$-matrices with positive eigenvalues under permutation similarity equals the number of acyclic digraphs on $n$ unlabeled vertices, corresponding to OEIS sequence A003087.