Abstract
Letk be an integer withk≥2. The Odd graphO k has the(k- l)-subsets of 1,2,..., 2k-1 as vertices, and two vertices are adjacent if and only if their corresponding subsets are disjoint. We prove that the odd graphsO k (k ≤ 6) are characterized by their spectra among connected regular graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bannai, E., Ito, T.: Algebraic Combinatorics I: Association Schemes, Benjamin-Cummings Lecture Note Series (1984)
Biggs, N.: Algebraic Graph Theory, Cambridge Univ. Press, Cambridge, 1974
Biggs, N.: Some Odd Graph Theory, Proc. Second Internat. Conf. on Comb. Math., Annals of the New York Academy of Science,319, 71–81 (1979)
Laskar, R.: Eigenvalues of the Adjacency Matrix of Cubic Lattice Graphs, Pacific J. Math.29 (3), 623–629 (1969)
Bose, R.C., Laskar, R.: Eigenvalues of the Adjacency Matrix of Tetrahedral Graphs, Aequationes Math.4, 37–43 (1970)
Moon, A.: Characterization of the Odd GraphsO k by Parameters, Discrete Math.42, 91–97(1982)
Schwenk, A.J., Wilson, R.J.: On the Eigenvalues of a Graph, pp. 307-336 in: Selected Topics in Graph Theory, L.W. Beineke and R.J. Wilson (eds), Academic P., 1981
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Huang, T. Spectral Characterization of Odd Graphs Ok,k ≤6 . Graphs and Combinatorics 10, 235–240 (1994). https://doi.org/10.1007/BF02986671
Issue Date:
DOI: https://doi.org/10.1007/BF02986671