Characterization of the odd graphs \(O_ k \)by parameters
From MaRDI portal
Publication:1168984
DOI10.1016/0012-365X(82)90057-7zbMath0494.05035MaRDI QIDQ1168984
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Related Items
Distance-transitive representations of the symmetric groups, Spectral characterization of odd graphs \(O_ k, k\leq 6\), P and Q polynomial schemes with \(q=-1\), Linear programming bounds for regular graphs, The subconstituent algebra of an association scheme. I, Distance-transitive graphs of valency 5, 6 and 7, The Terwilliger algebra of an almost-bipartite \(P\)- and \(Q\)-polynomial association scheme, Spectral bounds and distance-regularity, Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue, Root systems and the Johnson and Hamming graphs, The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\), Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k), On the uniqueness of the graphs G(n,k) of the Johnson schemes, On uniformly geodetic graphs, The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
Cites Work
