Distance-regular graphs the distance matrix of which has only one positive eigenvalue
From MaRDI portal
``In this paper we investigate the metric hierarchy for distance-regular graphs; in particular, we classify the graphs in the title.
Cited in
(24)- Cubic inflation, mirror graphs, regular maps, and partial cubes
- Problems on discrete metric spaces
- Addressing graph products and distance-regular graphs
- Graphs whose distance matrix has at most three negative eigenvalues
- Characterization of 2-arc-transitive partial cubes
- On the normalized distance Laplacian eigenvalues of graphs
- Distance spectra of graphs: a survey
- On the distance spectra of graphs
- Quadratic embedding constants of graph joins
- Hypercubes are determined by their distance spectra
- Graphs that are cospectral for the distance Laplacian
- The generalized distance spectrum of a graph and applications
- Determining finite connected graphs along the quadratic embedding constants of paths
- On distance Laplacian spectrum (energy) of graphs
- 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
- Primary non-QE graphs on six vertices
- The degree-distance and transmission-adjacency matrices
- Spectra of variants of distance matrices of graphs and digraphs: a survey
- A classification of graphs through quadratic embedding constants and clique graph insights
- Unimodality and peak location of the characteristic polynomials of two distance matrices of trees
- Normalized distance Laplacian energy change due to edge deletion in complete graph and complete multipartite graph
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)