Distance-regular graphs the distance matrix of which has only one positive eigenvalue
From MaRDI portal
Cited in
(21)- On the distance spectra of graphs
- Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue
- Addressing graph products and distance-regular graphs
- Graphs that are cospectral for the distance Laplacian
- The generalized distance spectrum of a graph and applications
- Graphs whose distance matrix has at most three negative eigenvalues
- The degree-distance and transmission-adjacency matrices
- Hypercubes are determined by their distance spectra
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- On the normalized distance Laplacian eigenvalues of graphs
- Distance spectra of graphs: a survey
- Hypercube embeddings and Cayley graphs generated by transpositions
- Characterization of 2-arc-transitive partial cubes
- Characterizing graphs with fully positive semidefinite \(Q\)-matrices
- Distance-regular graphs with a few \(q\)-distance eigenvalues
- On distance Laplacian spectrum (energy) of graphs
- Determining finite connected graphs along the quadratic embedding constants of paths
- Spectra of variants of distance matrices of graphs and digraphs: a survey
- Quadratic embedding constants of graph joins
- Primary non-QE graphs on six vertices
- Problems on discrete metric spaces
This page was built for publication: Distance-regular graphs the distance matrix of which has only one positive eigenvalue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329077)
