Spectral characterization of odd graphs O_ k, k 6
From MaRDI portal
The odd graph \(O_ k\), where \(k\geq 2\), has the \((k- 1)\)-subsets of \(\{1,2,\dots, 2k- 1\}\) as its vertices; and two such vertices are adjacent if and only if the corresponding subsets are disjoint. The author shows that if \(2\leq k\leq 6\) and \(\Gamma\) is a connected regular graph with the same spectrum as \(O_ k\), then \(\Gamma\) and \(O_ k\) are isomorphic.
Recommendations
Cites work
- Characterization of the odd graphs \(O_ k \)by parameters
- Eigenvalues of the adjacency matrix of cubic lattice graphs
- Eigenvalues of the adjacency matrix of tetrahedral graphs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3752880 (Why is no real title available?)
- scientific article; zbMATH DE number 3783047 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
Cited in
(7)- Spectral characterization of some generalized odd graphs
- Graph spectra
- scientific article; zbMATH DE number 3948332 (Why is no real title available?)
- A spectral excess theorem for nonregular graphs
- On Twisted Odd Graphs
- scientific article; zbMATH DE number 861422 (Why is no real title available?)
- A spectral excess theorem for normal digraphs
This page was built for publication: Spectral characterization of odd graphs \(O_ k, k\leq 6\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340122)
