Advertisement

Mathematical Notes

, Volume 103, Issue 5–6, pp 694–702 | Cite as

The Number of Labeled Outerplanar k-Cyclic Graphs

  • V. A. VoblyiEmail author
Article
  • 40 Downloads

Abstract

A k-cyclic graph is a graph with cyclomatic number k. An explicit formula for the number of labeled connected outerplanar k-cyclic graphs with a given number of vertices is obtained. In addition, such graphs with fixed cyclomatic number k and a large number of vertices are asymptotically enumerated. As a consequence, it is found that, for fixed k, almost all labeled connected outerplanar k-cyclic graphs with a large number of vertices are cacti.

Keywords

enumeration labeled graph connected graph k-cyclic graph outerplanar graph cactus asymptotics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F. Harary, Graph Theory (Addison–Wesley, Reading,MA, 1969; Mir, Moscow, 1973).zbMATHGoogle Scholar
  2. 2.
    M. Bodirsky, O. Gimenez, M. Kang, and M. Noy, “Enumeration and limit laws of series-parallel graphs,” European J. Combin. 28 (8), 2091–2105 (2007).MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    M. Bodirsky and M. Kang, “Generating outerplanar graphs uniformly at random,” Combin. Probab. Comput. 15 (3), 333–343 (2006).MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    M. Drmota, O. Giménez, and M. Noy, “Vertices of given degree in series-parallel graphs,” Random Structures Algorithms 36 (3), 273–314 (2010).MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    A. de Meir and M. Noy, “On the maximal number of cycles in outerplanar and series-parallel graphs,” Graphs Combin. 28 (3), 265–275 (2012).MathSciNetGoogle Scholar
  6. 6.
    V. A. Voblyi, “A formula for the number of labeled connected graphs,” Diskretn. Anal. Issled. Oper. 19 (4), 48–59 (2012).MathSciNetzbMATHGoogle Scholar
  7. 7.
    V. A. Voblyi, “A simple formula for the number of labeled outerplanar k-cyclic blocks,” in Proceedings of the XII International Seminar “Discrete Mathematics and Its Applications” (Izd. Moskov. Univ., Moscow, 2016), pp. 285–287 [in Russian].Google Scholar
  8. 8.
    V. A. Voblyi, “Enumeration of labeled connected graphs with given order and number of edges,” Diskretn. Anal. Issled. Oper. 23 (2), 5–20 (2016).zbMATHGoogle Scholar
  9. 9.
    I. P. Goulden and D. M. Jackson, Combinatorial Enumeration (John Wiley, New York, 1983; Nauka, Moscow, 1990).zbMATHGoogle Scholar
  10. 10.
    NIST Handbook of Mathematical Functions (Cambridge Univ. Press, Cambridge, 2010).Google Scholar
  11. 11.
    Yu. A. Brychkov, Handbook of Special Functions. Derivatives, Integrals, Series, and Other Formulas (Fizmatlit, Moscow, 2006; Chapman & Hall/CRC, Boca Raton, FL, 2008).zbMATHGoogle Scholar
  12. 12.
    E. M. Wright, “The number of connected sparsely edged graphs. III. Asymptotic results,” J. Graph Theory 4 (4), 393–407 (1980).MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  1. 1.All-Russian Institute of Scientific and Technical InformationRussian Academy of SciencesMoscowRussia

Personalised recommendations