From regular boundary graphs to antipodal distance-regular graphs

DOI<123::AID-JGT2>3.0.CO;2-Q 10.1002/(SICI)1097-0118(199803)27:3<123::AID-JGT2>3.0.CO;2-QzbMath0927.05086OpenAlexW4239797319MaRDI QIDQ4241730

E. Garriga, J. Luis A. Yebra, Miquel Àngel Fiol

Publication date: 13 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199803)27:3<123::aid-jgt2>3.0.co;2-q

zbMATH Keywords

orthogonal polynomialsdistance-regular graphseigenvaluesdiameterregular grapheccentricityboundary graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30)

Related Items

On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ Pseudo-Strong Regularity Around a Set ⋮ The alternating polynomials and their relation with the spectra and conditional diameters of graphs ⋮ From local adjacency polynomials to locally pseudo-distance-regular graphs ⋮ Boundary graphs. II: The limit case of a spectral property ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ Spectral bounds and distance-regularity ⋮ Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods ⋮ On Middle Cube Graphs ⋮ Spectrally extremal vertices, strong cospectrality, and state transfer