Graphs with the same determinant as a complete graph

DOI10.1016/S0024-3795(00)00114-2MaRDI QIDQ1573672zbMATH OpenOpenAlexFDO

Authors D. D. Olesky, P. van den Driessche, James H. Verner

Publication date 30 March 2001

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0024-3795(00)00114-2

zbMATH Keywords

adjacency matrixcirculantcomplete graphdeterminanteigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

It is well known that the determinant of the adjacency matrix of a complete graph \(K_n\) is equal to \((-1)^{n-1}(n-1)\). Recently it has been conjectured by \textit{X. Yong} [Linear Algebra Appl. 295, No. 1-3, 73-80 (1999; Zbl 0931.05056)] that \(K_n\) is the only class of graphs with such property. In the paper under review a family of symmetric circulant \((0,1)\)-matrices is studied. Each matrix in the family generates a graph that forms a counterexample to the conjecture. Eigenvalues of these matrices have an interesting octet structure.

Recommendations

• Circulant graphs with \(\det(-A(G))=-\deg(G)\): Codeterminants with \(K_n\)
• The determinant of the wheel graph and conjectures by Yong
• Proof of conjectures on adjacency eigenvalues of graphs
• Determinants of adjacency matrices of graphs

Cites work

• Combinatorial Matrices with Small Determinants
• Combinatorial matrix theory
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• On the distribution of eigenvalues of a simple undirected graph

Cited in

(7)

• Proof of conjectures on adjacency eigenvalues of graphs
• A determinant involving Ramanujan sums and So's conjecture
• Determinants of Seidel matrices and a conjecture of Ghorbani
• Smith forms for adjacency matrices of circulant graphs
• The determinant of the wheel graph and conjectures by Yong
• When do two planted graphs have the same cotransversal matroid?
• Circulant graphs with \(\det(-A(G))=-\deg(G)\): Codeterminants with \(K_n\)

This page was built for publication: Graphs with the same determinant as a complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1573672)