Unsolved Problems in Spectral Graph Theory
arXiv:2305.10290 · doi:10.15960/j.cnki.issn.1007-6093.2023.04.003
Abstract
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of topics in spectral graph theory, covering a range of open problems and conjectures. Our focus is primarily on the adjacency matrix of graphs, and for each topic, we provide a brief historical overview.
v3, 30 pages, 1 figure, include comments from Clive Elphick, Xiaofeng Gu, William Linz, and Dragan Stevanović, respectively. Thanks! This paper will be published in Operations Research Transactions