The distance-regular graphs such that all of its second largest local eigenvalues are at most one (Q550631): Difference between revisions

@@ Property / cites work @@
+Q3992965
@@ Property / cites work: Q3992965 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4105702
@@ Property / cites work: Q4105702 / rank @@
+Normal rank
@@ Property / cites work @@
+Line graphs, root systems, and elliptic geometry
@@ Property / cites work: Line graphs, root systems, and elliptic geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing distance-regularity of graphs by the spectrum
+Normal rank
@@ Property / cites work @@
+Q2716030
@@ Property / cites work: Q2716030 / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
+Normal rank
@@ Property / cites work @@
+The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
+Normal rank
@@ Property / cites work @@
+Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
+Normal rank
@@ Property / cites work @@
+Distance-regular graphs with girth 3 or 4: I
@@ Property / cites work: Distance-regular graphs with girth 3 or 4: I / rank @@
+Normal rank
@@ Property / cites work @@
+A new feasibility condition for distance-regular graphs
+Normal rank
@@ Property / cites work @@
+Root systems and the Johnson and Hamming graphs
@@ Property / cites work: Root systems and the Johnson and Hamming graphs / rank @@
+Normal rank