Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs

Main Article Content

Gui-Dong Yu
Yi-Zheng Fan
Yi Wang


Given a graph and a vector defined on the graph, a quadratic form is defined on the graph depending on its edges. In order to minimize the quadratic form on trees or unicyclic graphs associated with signless Laplacian, the notion of basic edge set of a graph is introduced, and the behavior of the least eigenvalue and the corresponding eigenvectors is investigated. Using these results a characterization of the unique bicyclic graph whose least eigenvalue attains the minimum among all non-bipartite bicyclic graphs of fixed order is obtained.

Article Details