Several improved asymptotic normality criteria and their applications to graph polynomials
From MaRDI portal
Publication:2689478
Recommendations
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
- A note on coefficients of chromatic polynomials
- An introduction to chromatic polynomials
- Analytic aspects of Delannoy numbers
- Asymptotic normality in enumeration
- Asymptotic normality of graph statistics
- Asymptotic normality of Laplacian coefficients of graphs
- Asymptotic normality of some graph sequences
- Asymptotic normality of some Graph-Related statistics
- Asymptotic properties of eulerian numbers
- Asymptotics of Stirling and Chebyshev-Stirling numbers of the second kind
- Central and local limit theorems applied to asymptotic enumeration
- Central limit theorems, Lee-Yang zeros, and graph-counting polynomials
- Chromatic coefficients of linear uniform hypergraphs
- Claw-free graphs---a survey
- Coefficients of chromatic polynomials
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 4091530 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1123787 (Why is no real title available?)
- Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
- Laplacian matrices of graphs: A survey
- Legendre-Stirling permutations
- Matching behaviour is asymptotically normal
- Non-chordal graphs having integral-root chromatic polynomials. II
- On chromatic coefficients
- On the asymptotic normality of the Legendre-Stirling numbers of the second kind
- On the Laplacian coefficients of acyclic graphs
- On the Laplacian coefficients of unicyclic graphs
- On the signless Laplacian coefficients of unicyclic graphs
- Real zeros and normal distribution for statistics on Stirling permutations defined by Gessel and Stanley
- Signless Laplacian coefficients and incidence energy of unicyclic graphs with the matching number
- Signless Laplacians of finite graphs
- Some results on signless Laplacian coefficients of graphs
- Stirling Behavior is Asymptotically Normal
- The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs
- The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal
- The fundamental limit theorems in probability
- The roots of the independence polynomial of a clawfree graph
- The signless Laplacian coefficients and incidence energy of bicyclic graphs
- Trees with minimal Laplacian coefficients
Cited in
(5)- Asymptotic normality of Laplacian coefficients of graphs
- The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs
- Asymptotic normality of some graph sequences
- Asymptotic normality for the coefficients of graph polynomials
- The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal
This page was built for publication: Several improved asymptotic normality criteria and their applications to graph polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689478)