Graphs with the same determinant as a complete graph (Q1573672)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1485566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with the same determinant as a complete graph |
scientific article; zbMATH DE number 1485566 |
Statements
Graphs with the same determinant as a complete graph (English)
0 references
30 March 2001
0 references
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.
0 references
complete graph
0 references
adjacency matrix
0 references
eigenvalues
0 references
determinant
0 references
circulant
0 references
0.9125310182571412
0 references
0.8296104669570923
0 references
0.7816065549850464
0 references
0.7773169875144958
0 references
