Asymptotic normality of Laplacian coefficients of graphs

Abstract

Let G be a simple graph with n vertices and let C(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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…