A quasi-spectral characterization of strongly distance-regular graphs
A graph \(\Gamma\) with diameter \(d\) is strongly distance-regular if \(\Gamma\) is distance-regular and its distance-\(d\) graph is strongly regular. It has been conjectured that a strongly distance-regular graph is antipodal or has diameter at most three. Let \(\Gamma\) be a graph with spectrum \(\{\lambda_0^{m_0},\dots,\lambda_d^{m_d}\}\), where \(\lambda_0>\cdots >\lambda_d\), and let \(n=|V(\Gamma)|\). Let \(\pi_i=\prod_{j\neq i}|\lambda_i-\lambda_j|\), \(\sigma_e=m_2+m_4+\cdots \), \(\sigma_o=m_1+m_3+\cdots \), \(\Sigma_e=\pi_0/\pi_2+\pi_0/\pi_4+\cdots \), \(\Sigma_o=\pi_0/\pi_1+\pi_0/\pi_3+\cdots \), for \(u\in V\) let \(k_{d-1}(u)= |\Gamma_{d-1}(u)|\) and let \(H={\displaystyle \frac{n}{\sum_{u\in V}1/k_{d-1}(u)}}\). The main result of this paper is the following Theorem 2.2: A regular graph \(\Gamma\) with \(n\) vertices, eigenvalues \(\lambda_0>\cdots >\lambda_d\), and parameters \(\sigma_e\) and \(\Sigma_e\) as above, is strongly distance-regular if and only if \[ H=n-\frac{n\sigma_e \sigma_o}{n\Sigma_e \Sigma_o+(\sigma_e-\Sigma_e) (\sigma_o+\Sigma_o)}. \]
- Some spectral characterizations of strongly distance-regular graphs
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- Spectral characterizations of some distance-regular graphs
- Spectral classes of strongly-regular and distance-regular graphs
- Characterizing distance-regularity of graphs by the spectrum
- Distance-regularity and the spectrum of graphs
- On the distance spectrum of distance regular graphs
- scientific article; zbMATH DE number 1778119
- Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
- On quasi-strongly regular graphs
- An eigenvalue characterization of antipodal distance-regular graphs
- Distance regularity of compositions of graphs.
- Spectral bounds and distance-regularity
- Spectra of strongly Deza graphs
- The Laplacian spectral excess theorem for distance-regular graphs
- Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues
- Spectral classes of strongly-regular and distance-regular graphs
- Some spectral characterizations of strongly distance-regular graphs
- The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
- The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues
This page was built for publication: A quasi-spectral characterization of strongly distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583622)
