Spectral classes of strongly-regular and distance-regular graphs (Q2669190)

From MaRDI portal
Revision as of 21:05, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Spectral classes of strongly-regular and distance-regular graphs
scientific article

    Statements

    Spectral classes of strongly-regular and distance-regular graphs (English)
    0 references
    0 references
    0 references
    9 March 2022
    0 references
    A notion of spectral limit for sequences of graphs was introduced in [\textit{J. Gu} et al., ibid. 489, 30--49 (2016; Zbl 1327.05205)]. This limit is defined as the limit of the Radon probability measures associated with graphs based on their spectrum of normalized Laplacian matrix. So far, the spectral classes of a few families of graphs, such as complete graphs, hypercubes, friendship graphs, paths, and cycles were determined. In this paper, the authors determine the spectral limit for sequences of strongly-regular as well as distance-regular graphs with classical parameters which includes Hamming and Johnson graphs and a few more classes.
    0 references
    spectral limit
    0 references
    normalized Laplacian
    0 references
    strongly-regular graph
    0 references
    distance-regular graph
    0 references
    0 references

    Identifiers