Distance-regular graphs the distance matrix of which has only one positive eigenvalue

DOI10.1006/eujc.1994.1030zbMath0796.05070OpenAlexW1994300999MaRDI QIDQ1329077

Sergey V. Shpectorov, Jack H. Koolen

Publication date: 19 July 1994

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1994.1030

zbMATH Keywords

distance-regular graphspositive eigenvaluedistance matrixmetric hierarchy

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The generalized distance spectrum of a graph and applications, Hypercubes are determined by their distance spectra, Determining finite connected graphs along the quadratic embedding constants of paths, Quadratic embedding constants of graph joins, Hypercube embeddings and Cayley graphs generated by transpositions, Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue, Characterizing graphs with fully positive semidefinite \(Q\)-matrices, Distance-regular graphs with a few \(q\)-distance eigenvalues, Cubic inflation, mirror graphs, regular maps, and partial cubes, Distance spectra of graphs: a survey, Addressing graph products and distance-regular graphs, Problems on discrete metric spaces, Characterization of 2-arc-transitive partial cubes, On the normalized distance Laplacian eigenvalues of graphs, On distance Laplacian spectrum (energy) of graphs, Graphs that are cospectral for the distance Laplacian, On the distance spectra of graphs