The graphs with all but two eigenvalues equal to \(\pm 1\) (Q2346766): Difference between revisions

@@ Property / cites work @@
+Graphs cospectral with a friendship graph or its complement
+Normal rank
@@ Property / cites work @@
+Spectra of graphs
@@ Property / cites work: Spectra of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Which graphs are determined by their spectrum?
@@ Property / cites work: Which graphs are determined by their spectrum? / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial designs with two singular values. I: Uniform multiplicative designs
+Normal rank
@@ Property / cites work @@
+Proof of conjectures on adjacency eigenvalues of graphs
+Normal rank
@@ Property / cites work @@
+Q5520566
@@ Property / cites work: Q5520566 / rank @@
+Normal rank
@@ Property / cites work @@
+On the two largest \(Q\)-eigenvalues of graphs
@@ Property / cites work: On the two largest \(Q\)-eigenvalues of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5632577
@@ Property / cites work: Q5632577 / rank @@
+Normal rank