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 ...

Rocky Mountain Journal of Mathematics publishes both research and expository articles in mathematics, and particularly invites well-written survey articles. The Rocky Mountain Journal of Mathematics ...

The authors do not work for, consult, own shares in or receive funding from any company or organization that would benefit from this article, and have disclosed no relevant affiliations beyond their ...