Generating connected and 2-edge connected graphs

被引:0
|
作者
Doppler Institute and Department of Mathematics, FNSPE, Czech Technical University, Trojanova 13, 120 00 Praha 2, Czech Republic [1 ]
不详 [2 ]
机构
来源
J. Graph Algorithms and Appl. | 2009年 / 2卷 / 251-281期
关键词
Graph theory - Graphic methods;
D O I
10.7155/jgaa.00187
中图分类号
O144 [集合论]; O157 [组合数学(组合学)];
学科分类号
070104 ;
摘要
We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and effcient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequently to further classes of connected graphs, namely, 2-edge connected, simple and loopless graphs. Our method con- sists of basic graph transformations only.
引用
收藏
相关论文
共 50 条
  • [41] Super-connected but not super edge-connected graphs
    Zhou, Jin-Xin
    Feng, Yan-Quan
    INFORMATION PROCESSING LETTERS, 2010, 111 (01) : 22 - 25
  • [42] ALGEBRAIC MODELS FOR 2-EDGE-CONNECTED GRAPHS
    HARTFIEL, DJ
    MAXSON, CJ
    DISCRETE MATHEMATICS, 1976, 15 (02) : 141 - 150
  • [43] The node-edge weighted 2-edge connected subgraph problem:: Linear relaxation, facets and separation
    Baiou, Mourad
    Correa, Jose R.
    DISCRETE OPTIMIZATION, 2006, 3 (02) : 123 - 135
  • [44] Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
    Zhao, Shuang
    Chen, Zongqing
    Yang, Weihua
    Meng, Jixiang
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 115 : 64 - 72
  • [45] A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs
    Tada, Takumi
    Haraguchi, Kazuya
    COMBINATORIAL ALGORITHMS, IWOCA 2023, 2023, 13889 : 368 - 379
  • [46] TOWARD A 6/5 BOUND FOR THE MINIMUM COST 2-EDGE CONNECTED SPANNING SUBGRAPH
    Boyd, Sylvia
    Legault, Philippe
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 632 - 644
  • [47] IMMERSIONS IN HIGHLY EDGE CONNECTED GRAPHS
    Marx, Daniel
    Wollan, Paul
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (01) : 503 - 520
  • [48] CONNECTED GRAPHS WITH EVERY EDGE IN A TRIANGLE
    CALLAN, D
    AMERICAN MATHEMATICAL MONTHLY, 1990, 97 (09): : 848 - 849
  • [49] The edge domination number of connected graphs
    Chaemchan, Araya
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 48 : 185 - 189
  • [50] NEIGHBORHOOD CONNECTED EDGE DOMINATION IN GRAPHS
    Sivagnanaim, C.
    Kulandaivel, M. P.
    Selvaraju, P.
    TAMKANG JOURNAL OF MATHEMATICS, 2012, 43 (01): : 69 - 80