Asymptotic normality of Laplacian coefficients of graphs

DOI10.1016/J.JMAA.2017.06.052zbMATH Open1368.05075arXiv1709.03407OpenAlexW2963117544MaRDI QIDQ2014147FDOQ2014147

Bao-Xuan Zhu, Yi Wang, Haixia Zhang

Publication date: 10 August 2017

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Abstract: Let $G$ be a simple graph with $n$ vertices and let ${\displaystyle }$C(G;x)=sum_{k=0}^n(-1)^{n-k}c(G,k)x^k${\displaystyle }$ denote the Laplacian characteristic polynomial of $G$. Then if the size $|E(G)|$ is large compared to the maximum degree $Delta(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 work available at URL: https://arxiv.org/abs/1709.03407

zbMATH Keywords

asymptotic normalitycentral limit theoremLaplacian matrixLaplacian coefficientlocal limit theorem

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Signless Laplacians of finite graphs
• Eigenvalues of the Laplacian of a graph^∗
• Connections between Wiener index and matchings
• Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
• A connection between ordinary and Laplacian spectra of bipartite graphs
• Wiener index of trees: Theory and applications
• On the Laplacian coefficients of acyclic graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• Matching behaviour is asymptotically normal
• Central and local limit theorems applied to asymptotic enumeration
• Central limit theorems, Lee-Yang zeros, and graph-counting polynomials
• Stirling Behavior is Asymptotically Normal
• A normal law for matchings
• A certain polynomial of a graph and graphs with an extremal number of trees
• The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal

Cited In (9)

• Cyclic derangement polynomials of the wreath product \(\mathcal{C}_r\wr S_n\)
• Asymptotic normality of coefficients of some polynomials related to Dowling lattices
• Asymptotic joint spectra of Cartesian powers of strongly regular graphs and bivariate Charlier–Hermite polynomials
• Asymptotic normality of some graph sequences
• Some analytical properties of the matrix related to q-coloured Delannoy numbers
• Asymptotic normality of associated Lah numbers
• Asymptotic normality in t-stack sortable permutations
• Several improved asymptotic normality criteria and their applications to graph polynomials
• The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs

This page was built for publication: Asymptotic normality of Laplacian coefficients of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014147)