Spectral characterization of the Hamming graphs

DOI10.1016/J.LAA.2007.10.026MaRDI QIDQ952057zbMATH OpenOpenAlexFDO

Authors Sejeong Bang, Edwin R. Van Dam, Jack H. Koolen

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

cospectral graphsdistance-regular graphsgeometric graphsHamming graphs

Mathematics Subject Classification ID

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

Review text

It is shown that the Hamming graph \(H(3,q)\) with diameter three is uniquely determined by its spectrum for \(q\geq 36\). It is also demonstrated that for given integer \(D\geq 2\), any graph cospectral with the Hamming graph \(H(D,q)\) is locally the disjoint union of \(D\) copies of the complete graph of size \(q-1\), for \(q\) large enough.

Recommendations

• GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS
• A short proof of a theorem of Bang and Koolen
• Spectral characterizations of some distance-regular graphs
• A characterization of the Hamming graph by strongly closed subgraphs
• Characterizing distance-regularity of graphs by the spectrum

Cites work

• A characterization of Grassmann graphs
• Characterizing distance-regularity of graphs by the spectrum
• Graphs cospectral with distance-regular graphs
• GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Improvement of Bruck's completion theorem
• On the Polynomial of a Graph

Cited in

(22)

• Developments on spectral characterizations of graphs
• A note on the spectral characterization of \(\theta \)-graphs
• The retracts of Hamming graphs
• A generalization of a theorem of Hoffman
• 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
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Recognizing Hamming graphs in linear time and space
• Hypercubes are determined by their distance spectra
• GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS
• scientific article; zbMATH DE number 1795870 (Why is no real title available?)
• scientific article; zbMATH DE number 1373450 (Why is no real title available?)
• An application of Hoffman graphs for spectral characterizations of graphs
• scientific article; zbMATH DE number 7689250 (Why is no real title available?)
• The optimal bound on the 3-independence number obtainable from a polynomial-type method
• The edge fault-tolerance about the strong Menger edge-connectivity of order r among Hamming graph
• Hamming index of product graphs
• Fault tolerance assessment for Hamming graphs based on r-restricted R-structure(substructure) fault pattern
• A note on the spectral characterization of dumbbell graphs
• The cospectral equivalence classes of graphs having an isolated vertex
• A short proof of a theorem of Bang and Koolen

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952057)