Abstract
The labeled geodetic outerplanar and planar graphs with a prescribed number of vertices are enumerated and an asymptotic formula for the number of such graphs with a large number of vertices is obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. G. Stemple and M. E.Watkins, “On planar geodetic graphs,” J. Combin. Theory 4, 101–117 (1968).
V. A.Voblyi, “A formula for the number of labeled connected graphs,” Diskretnyi Analiz i Issledovanie Operatsii 19 (4), 48–59 (2012).
I. Goulden and D. Jackson, Combinatorial Enumeration (Wiley, New York, 1983; Nauka, Moscow, 1990).
A. P. Prudnikov, Yu. A. Brychkov, and O. I. Marichev, Integrals and Series, Vol. 1: Elementary Functions (Fizmatlit, Moscow, 2003) [in Russian].
Ph. Flajolet and R. Sedgewick, Analytic Combinatorics (Cambridge Univ. Press, Cambridge, 2009).
I. Plesník, “Two construction of geodetic graphs,” Math. Slovaca 27 (1), 65–71 (1977).
B. Zelinka, “Geodetic graphs which are homeomorphic to complete graphs,” Math. Slovaca 27 (2), 129–132 (1977).
G. W. Ford and G. E. Uhlenbeck, “Combinatorial problems in theory graphs. IV,” Proc. Nat. Acad. Sci. U. S. A. 43, 163–167 (1957).
K. A. Rybnikov, Introduction to Combinatorial Analysis (Izd.Moskov. Univ., Moscow, 1985) [in Russian].
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Voblyi, V.A. Enumeration of labeled geodetic planar graphs. Math Notes 97, 321–325 (2015). https://doi.org/10.1134/S0001434615030025
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434615030025