On the Maximum Number of Cycles in Outerplanar and Series-Parallel Graphs

被引：8
|
作者：
de Mier, Anna [1 ]
Noy, Marc [1 ]
机构：
[1] Univ Politecn Cataluna, Dept Matemat Aplicada 2, ES-08034 Barcelona, Spain
来源：
GRAPHS AND COMBINATORICS | 2012年 / 28卷 / 02期
关键词：
Cycles; Outerplanar graph; Series-parallel graph; PLANAR GRAPHS;
D O I：
10.1007/s00373-011-1039-9
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let c(n) be themaximum number of cycles in an outerplanar graph with n vertices. We show that lim c(n)(1/n) exists and equals beta = 1.502837 ..., where beta is a constant related to the recurrence x(n+1) = 1 + x(n)(2), x(0) = 1. The same result holds for the larger class of series-parallel graphs.
引用
收藏
页码：265 / 275
页数：11
相关论文
共 50 条
  • [1] On the Maximum Number of Cycles in Outerplanar and Series–Parallel Graphs
    Anna de Mier
    Marc Noy
    [J]. Graphs and Combinatorics, 2012, 28 : 265 - 275
  • [2] On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
    Bernasconi, Nicla
    Panagiotou, Konstantinos
    Steger, Angelika
    [J]. APPROXIMATION RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2008, 5171 : 303 - 316
  • [3] Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
    Therese Biedl
    [J]. Discrete & Computational Geometry, 2011, 45 : 141 - 160
  • [4] DOMINATING CYCLES IN SERIES-PARALLEL GRAPHS
    COLBOURN, CJ
    STEWART, LK
    [J]. ARS COMBINATORIA, 1985, 19A (MAY) : 107 - 112
  • [5] Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
    Biedl, Therese
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2011, 45 (01) : 141 - 160
  • [6] On the Structure of Maximum Series-Parallel Graphs
    Korenblit, Mark
    Levit, Vadim E.
    [J]. NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS A-C, 2011, 1389
  • [7] The Maximum Degree of Series-Parallel Graphs
    Drmota, Michael
    Gimenez, Omer
    Noy, Marc
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2011, 20 (04): : 529 - 570
  • [8] MAXIMUM INDEPENDENT NUMBER FOR SERIES-PARALLEL NETWORKS
    HSU, LH
    WANG, SY
    [J]. NETWORKS, 1991, 21 (04) : 457 - 468
  • [9] The circular chromatic number of series-parallel graphs
    Hell, P
    Zhu, XD
    [J]. JOURNAL OF GRAPH THEORY, 2000, 33 (01) : 14 - 24
  • [10] On Maximum Common Subgraph Problems in Series-Parallel Graphs
    Kriege, Nils
    Kurpicz, Florian
    Mutzel, Petra
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 200 - 212
12345