On the Enumeration of Labeled Series-Parallel \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k $$\end{document}-Cyclic \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2 $$\end{document}-Connected Graphs

被引:0
作者
V. A. Voblyi
机构
[1] All-Russian Institute for Scientific and Technical Information of Russian Academy of Sciences,
关键词
enumeration; labeled graph; series-parallel graph; k-cyclic graph; asymptotics; random graph;
D O I
10.1134/S1990478921010154
中图分类号
学科分类号
摘要
引用
收藏
页码:169 / 174
页数:5
相关论文
共 10 条
  • [1] Bodirsky M.(2007)Enumeration and Limit Laws of Series-Parallel Graphs European J. Combin. 28 2091-2105
  • [2] Gimenez O.(2004)Low-Connectivity Network Design on Series-Parallel Graphs Networks 43 163-176
  • [3] Kang M.(2019)The Second Riddell Relation and Its Consequences J. Appl. Ind. Math. 13 168-174
  • [4] Noy M.(2020)Explicit Formula for the Number of Labeled Series-Parallel Math. Notes 108 608-610
  • [5] Radhavan S.(1965)-Cyclic Blocks Theory Probab. Appl. 10 139-144
  • [6] Voblyi V.A.(1983)Asymptotic Representations of Finite Differences of a Power Function at an Arbitrary Point J. Graph Theory 7 219-229
  • [7] Voblyi V.A.(undefined)The Number of Connected Sparsely Edged Graphs. IV undefined undefined undefined-undefined
  • [8] Medvedev Yu.I.(undefined)undefined undefined undefined undefined-undefined
  • [9] Ivchenko G.I.(undefined)undefined undefined undefined undefined-undefined
  • [10] Wright E.M.(undefined)undefined undefined undefined undefined-undefined