The degree distance of a connected graph G with vertex set V(G) is defined as $\sum\limits_{u \in V\left( G \right)} {{d_G}} \left( u \right){D_G}\left( u \right)$, where dG(u) is the degree of vertex ...

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