Let d₁ ≥ d₂ ≥ ··· ≥ dn be the degree sequence of a graph G of order n and μ₁ ≥ μ₂ ≥ ··· ≥ μn = 0 be the Laplacian eigenvalues of G. In this paper, we propose a new conjecture that for any graph G ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback