Veronika Kraus
-
The degree distribution in unlabelled 2-connected graph families
dmtcs:2773 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2010,
DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
-
https://doi.org/10.46298/dmtcs.2773
The degree distribution in unlabelled 2-connected graph familiesArticle
Authors: Veronika Kraus 1
NULL
Veronika Kraus
1 Institut für Diskrete Mathematik und Geometrie [Wien]
We study the random variable Xkn, counting the number of vertices of degree k in a randomly chosen 2-connected graph of given families. We prove a central limit theorem for Xkn with expected value EXkn∼μkn and variance VXkn∼σ2kn, both asymptotically linear in n, for both rooted and unrooted unlabelled 2-connected outerplanar or series-parallel graphs.
Volume: DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Benedikt Stufler, 2021, Asymptotic Properties of Random Unlabelled Block-Weighted Graphs, The Electronic Journal of Combinatorics, 28, 4, 10.37236/9923, https://doi.org/10.37236/9923.