Title of article
Graphs with the same determinant as a complete graph Original Research Article
Author/Authors
D. D. Olesky، نويسنده , , P. van den Driessche، نويسنده , , J. H. Verner، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
5
From page
191
To page
195
Abstract
A family of n×n symmetric circulant (0, 1) matrices is studied. It is shown that the determinant of each matrix is (−1)n−1(n−1), a property shared with the adjacency matrix of the complete graph on n nodes. As a result, each matrix in this family generates an incomplete graph that forms a counterexample to a recent conjecture.
Keywords
Circulant , complete graph , Eigenvalues , Determinant , Adjacency matrix
Journal title
Linear Algebra and its Applications
Serial Year
2000
Journal title
Linear Algebra and its Applications
Record number
823017
Link To Document