Spectral characterization of odd graphs \(O_ k, k\leq 6\)
type: Item
instance of: scholarly article
title: Spectral characterization of odd graphs \(O_ k, k\leq 6\)
zbMATH Open document ID: 0812.05043
DOI: 10.1007/BF02986671
author: Tayuan Huang
published in: Graphs and Combinatorics
publication date: 1994-12-11T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 700938
zbMATH Keywords: spectral characterization
zbMATH Keywords: regular graph
zbMATH Keywords: spectrum
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: Q3218140
cites work: Q4770409
cites work: Q3936766
cites work: Eigenvalues of the adjacency matrix of cubic lattice graphs
cites work: Eigenvalues of the adjacency matrix of tetrahedral graphs
cites work: Characterization of the odd graphs \(O_ k \)by parameters
cites work: Q3960731
full work available at URL: https://doi.org/10.1007/bf02986671
OpenAlex ID: W2079422238
description: scientific article; zbMATH DE number 700938