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 ...
This is a preview. Log in through your library . Abstract In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback