Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs

We determine the exact and asymptotic number of unlabeled outerplanar graphs . The exact number $g_{n}$ of unlabeled outerplanar graphs on $n$ vertices can be computed in polynomial time, and $g_{n}$ is asymptotically $g\, n^{-5/2}\rho^{-n}$, where $g\approx0.00909941$ and $\rho^{-1}\approx7.50360$ can be approximated. Using our enumerative results we investigate several statistical properties of random unlabeled outerplanar graphs on $n$ vertices, for instance concerning connectedness, the chromatic number, and the number of edges. To obtain the results we combine classical cycle index enumeration with recent results from analytic combinatorics.

[1]  Two Asymptotic Series , 2003 .

[2]  Decomposing, Counting, and Generating Unlabeled Cubic Planar Graphs , 2003 .

[3]  Colin McDiarmid,et al.  Random planar graphs with n nodes and a fixed number of edges , 2005, SODA '05.

[4]  Edward A. Bender,et al.  The Number of Labeled 2-Connected Planar Graphs , 2002, Electron. J. Comb..

[5]  Deryk Osthus,et al.  On random planar graphs, the number of planar graphs and their triangulations , 2003, J. Comb. Theory, Ser. B.

[6]  Colin McDiarmid,et al.  Random planar graphs , 2005, J. Comb. Theory B.

[7]  G. Pólya.  Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .

[8]  Éric Fusy,et al.  Dissections and trees, with applications to optimal mesh encoding and to random sampling , 2005, SODA '05.

[9]  R. Otter.  The Number of Trees , 1948 .

[10]  Omer Giménez,et al.  Asymptotic enumeration and limit laws of planar graphs , 2005, math/0501269.

[11]  Eric Fusy.  Counting Unrooted Maps Using Tree- Decompositionéric Fusy , 2022 .

[12]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[13]  Gilles Schaeffer,et al.  Random sampling of large planar maps and convex polyhedra , 1999, STOC '99.

[14]  Colin McDiarmid,et al.  On the Number of Edges in Random Planar Graphs , 2004, Combinatorics, Probability and Computing.

[15]  Timothy R. S. Walsh,et al.  Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs , 1982, J. Comb. Theory, Ser. B.

[16]  Manuel Bodirsky,et al.  Generating Labeled Planar Graphs Uniformly at Random , 2003, ICALP.

[17]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[18]  Philippe Flajolet,et al.  Analytic combinatorics of non-crossing configurations , 1999, Discret. Math..

[19]  Robert W. Robinson,et al.  Enumeration of non-separable graphs* , 1970 .

[20]  Manuel Bodirsky,et al.  Generating Outerplanar Graphs Uniformly at Random , 2006, Combinatorics, Probability and Computing.

[21]  F. Harary,et al.  Planar Permutation Graphs , 1967 .

[22]  W. T. Tutte.  A Census of Planar Maps , 1963, Canadian Journal of Mathematics.

[23]  R. Mullin,et al.  The enumeration of c-nets via quadrangulations , 1968 .

[24]  C. Gröpl,et al.  A direct decomposition of 3-connected planar graphs , 2007 .

[25]  Ronald C. Read.  On general dissections of a polygon , 1978 .

[26]  Gilbert Labelle,et al.  Combinatorial species and tree-like structures , 1997, Encyclopedia of mathematics and its applications.

[27]  Gilbert Labelle,et al.  Labelled and unlabelled enumeration of k-gonal 2-trees , 2004, J. Comb. Theory, Ser. A.

[28]  John W. Rosenthal,et al.  How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function , 1994 .

[29]  Manuel Bodirsky,et al.  Sampling Unlabeled Biconnected Planar Graphs , 2005, ISAAC.

[30]  Philippe Flajolet,et al.  Random maps, coalescing saddles, singularity analysis, and Airy phenomena , 2001, Random Struct. Algorithms.

[31]  Manuel Bodirsky,et al.  Generating labeled planar graphs uniformly at random , 2003, Theor. Comput. Sci..