A quasi-spectral characterization of strongly distance-regular graphs (Q1583622)

From MaRDI portal
Revision as of 03:59, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A quasi-spectral characterization of strongly distance-regular graphs
scientific article

    Statements

    A quasi-spectral characterization of strongly distance-regular graphs (English)
    0 references
    0 references
    30 November 2000
    0 references
    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)}. \]
    0 references
    distance-regular graphs
    0 references
    strongly regular graph
    0 references
    spectral characterization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references