Abstract

Let G be a simple graph with n vertices and letC(G;x)=∑k=0n(−1)n−kc(G,k)xk denote the Laplacian characteristic polynomial of G. Then if the size |E(G)| is large compared to the maximum degree Δ(G), Laplacian coefficients c(G,k) are approximately normally distributed (by central and local limit theorems). We show that Laplacian coefficients of the paths, the cycles, the stars, the wheels and regular graphs of degree d are approximately normally distributed respectively. We also point out that Laplacian coefficients of the complete graphs and the complete bipartite graphs are approximately Poisson distributed respectively.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call