Asymptotic normality of Laplacian coefficients of graphs

DOI10.1016/J.JMAA.2017.06.052MaRDI QIDQ2014147zbMATH OpenOpenAlexFDO

Authors Yi Wang, Haixia Zhang, Bao-Xuan Zhu

Publication date 10 August 2017

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

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)

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.

Recommendations

• The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs
• Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones
• Several improved asymptotic normality criteria and their applications to graph polynomials
• Asymptotic normality of some graph sequences
• The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes

Cites work

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

Cited in

(9)

• The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs
• Asymptotic normality of associated Lah numbers
• Some analytical properties of the matrix related to \(q\)-coloured Delannoy numbers
• Several improved asymptotic normality criteria and their applications to graph polynomials
• Cyclic derangement polynomials of the wreath product \(\mathcal{C}_r\wr S_n\)
• Asymptotic normality of some graph sequences
• 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 in \(t\)-stack sortable permutations

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)