The maximal b1-spectral-radius conjecture for bicyclic graphs
The maximal b1-spectral-radius conjecture for bicyclic graphs
Let , and let denote the family of bicyclic graphs with order and diameter . For a graph , write its -spectral radius as the largest eigenvalue of its -matrix. Let be the specified bicyclic graph in the paper.
Maximal -spectral-radius conjecture. If has the maximal -spectral radius among graphs in , then
This conjecture extends the paper's extremal results for the signless Laplacian spectral radius and is motivated by those theorems and numerical calculations. Its status is not resolved in the supplied text.
Sources & referencesView supporting material
Primary source
F. F. Wang, H. Y. Shan and Y. Y. Zhai, “On the spectral radius of unicyclic and bicyclic graphs with a fixed diameter”, arXiv:2106.09238 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.