English

Asymptotic normality of Laplacian coefficients of graphs

Combinatorics 2017-09-13 v2

Abstract

Let GG be a simple graph with nn vertices and let C(G;x)=k=0n(1)nkc(G,k)xkC(G;x)=\sum_{k=0}^n(-1)^{n-k}c(G,k)x^k denote the Laplacian characteristic polynomial of GG. Then if the size E(G)|E(G)| is large compared to the maximum degree Δ(G)\Delta(G), Laplacian coefficients c(G,k)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 dd 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.

Keywords

Cite

@article{arxiv.1709.03407,
  title  = {Asymptotic normality of Laplacian coefficients of graphs},
  author = {Yi Wang and Haixia Zhang and Baoxuan Zhu},
  journal= {arXiv preprint arXiv:1709.03407},
  year   = {2017}
}