The graphs with all but two eigenvalues equal to \(\pm 1\) (Q2346766): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Graphs cospectral with a friendship graph or its complement / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spectra of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Which graphs are determined by their spectrum? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial designs with two singular values. I: Uniform multiplicative designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof of conjectures on adjacency eigenvalues of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5520566 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the two largest \(Q\)-eigenvalues of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5632577 / rank | |||
Normal rank |
Latest revision as of 04:58, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The graphs with all but two eigenvalues equal to \(\pm 1\) |
scientific article |
Statements
The graphs with all but two eigenvalues equal to \(\pm 1\) (English)
0 references
4 June 2015
0 references
adjacency matrix
0 references
friendship graph
0 references
spectral characterization
0 references