Spectral characterization of the Hamming graphs

DOI10.1016/j.laa.2007.10.026zbMath1152.05041OpenAlexW3121186459MaRDI QIDQ952057

Sejeong Bang, Jack H. Koolen, van Dam, Edwin R.

Publication date: 6 November 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://pure.uvt.nl/portal/en/publications/spectral-characterization-of-the-hamming-graphs(6c76624a-3730-43b0-b209-9f6dddf7b766).html

zbMATH Keywords

distance-regular graphsgeometric graphscospectral graphsHamming graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (13)

Hypercubes are determined by their distance spectra ⋮ Spectral characterization of some cubic graphs ⋮ Note on the spectral characterization of some cubic graphs with maximum number of triangles ⋮ Geometric distance-regular graphs without 4-claws ⋮ The optimal bound on the 3-independence number obtainable from a polynomial-type method ⋮ A generalization of a theorem of Hoffman ⋮ An application of Hoffman graphs for spectral characterizations of graphs ⋮ The cospectral equivalence classes of graphs having an isolated vertex ⋮ A short proof of a theorem of Bang and Koolen ⋮ A note on the spectral characterization of dumbbell graphs ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Developments on spectral characterizations of graphs ⋮ A note on the spectral characterization of \(\theta \)-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing distance-regularity of graphs by the spectrum
• Improvement of Bruck's completion theorem
• A characterization of Grassmann graphs
• GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS
• On the Polynomial of a Graph
• Graphs cospectral with distance-regular graphs

This page was built for publication: Spectral characterization of the Hamming graphs