The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) (Q517364): Difference between revisions

@@ Property / cites work @@
+Graphs cospectral with a friendship graph or its complement
+Normal rank
@@ Property / cites work @@
+The graphs with all but two eigenvalues equal to \(\pm 1\)
+Normal rank
@@ Property / cites work @@
+Q3642517
@@ Property / cites work: Q3642517 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of conjectures on adjacency eigenvalues of graphs
+Normal rank
@@ Property / cites work @@
+Complete multipartite graphs are determined by their distance spectra
+Normal rank
@@ Property / cites work @@
+On graphs with at least three distance eigenvalues less than \(-1\)
+Normal rank
@@ Property / cites work @@
+On a property of the class of n-colorable graphs
@@ Property / cites work: On a property of the class of n-colorable 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 @@
+Developments on spectral characterizations of graphs
+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 @@
+On the least distance eigenvalue of a graph
@@ Property / cites work: On the least distance eigenvalue of a graph / rank @@
+Normal rank