THE TRANSITIVE GRAPHS WITH A MOST 26 VERTICES

被引：0
|
作者：
MCKAY, BD [1 ]
ROYLE, GF [1 ]
机构：
[1] UNIV WESTERN AUSTRALIA,DEPT MATH,NEDLANDS,WA 6009,AUSTRALIA
来源：
ARS COMBINATORIA | 1990年 / 30卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We complete the construction of all the simple graphs with at most 26 vertices and transitive automorphism group. The transitive graphs with up to 19 vertices were earlier constructed by McKay, and the transitive graphs with 24 vertices by Praeger and Royle. Although most of the construction was done by computer, a substantial preparation was necessary. Some of this theory may be on independent interest.
引用
收藏
页码：161 / 176
页数：16
相关论文
共 50 条
  • [1] TRANSITIVE GRAPHS WITH FEWER THAN 20 VERTICES
    MCKAY, BD
    MATHEMATICS OF COMPUTATION, 1979, 33 (147) : 1101 - 1121
  • [2] *-graphs of vertices of the generalized transitive tournament polytope
    Borobia, A
    Chumillas, V
    DISCRETE MATHEMATICS, 1998, 179 (1-3) : 49 - 57
  • [3] All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs
    Calamoneri, Tiziana
    Frascaria, Dario
    Sinaimeri, Blerina
    COMPUTER JOURNAL, 2013, 56 (07): : 882 - 886
  • [4] Cubic vertex-transitive graphs on up to 1280 vertices
    Potocnik, Primoz
    Spiga, Pablo
    Verret, Gabriel
    JOURNAL OF SYMBOLIC COMPUTATION, 2013, 50 : 465 - 477
  • [5] A characterization of graphs with at most four boundary vertices
    Chiem, Nick
    Dudarov, William
    Lee, Chris
    Lee, Sean
    Liu, Kevin
    JOURNAL OF COMBINATORICS, 2024, 15 (03) : 361 - 382
  • [6] Generating All Rigidity Circuits on at Most 10 Vertices and All Assur Graphs on at Most 11 Vertices
    Mc Glue, Ciaran
    Stokes, Klara
    JOURNAL OF INTEGER SEQUENCES, 2022, 25 (01)
  • [7] Tetravalent edge-transitive Cayley graphs with odd number of vertices
    Cai, HL
    Zai, PL
    Hua, Z
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (01) : 164 - 181
  • [8] ENUMERATION OF STRICTLY DEZA GRAPHS WITH AT MOST 21 VERTICES
    Goryainov, S., V
    Panasenko, D., I
    Shalaginov, L., V
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2021, 18 (02): : 1423 - 1432
  • [9] Classification of divisible design graphs with at most 39 vertices
    Panasenko, Dmitry
    Shalaginov, Leonid
    JOURNAL OF COMBINATORIAL DESIGNS, 2022, 30 (04) : 205 - 219
  • [10] Three color Ramsey numbers for graphs with at most 4 vertices
    Boza, Luis
    Dybizbanski, Janusz
    Dzido, Tomasz
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (04):
12345