TRANSITIVE GRAPHS WITH FEWER THAN 20 VERTICES

被引：0
|
作者：
MCKAY, BD
机构：
来源：
MATHEMATICS OF COMPUTATION | 1979年 / 33卷 / 147期
关键词：
D O I：
10.2307/2006085
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：1101 / 1121
页数：21
相关论文
共 50 条
  • [1] CAYLEY-DEZA GRAPHS WITH FEWER THAN 60 VERTICES
    Goryainov, S., V
    Shalaginov, L., V
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2014, 11 : 268 - 310
  • [2] THE TRANSITIVE GRAPHS WITH A MOST 26 VERTICES
    MCKAY, BD
    ROYLE, GF
    ARS COMBINATORIA, 1990, 30 : 161 - 176
  • [3] INERTIA SETS FOR GRAPHS ON SIX OR FEWER VERTICES
    Barrett, Wayne
    Jepsen, Camille
    Lang, Robert
    Mchenry, Emily
    Nelson, Curtis
    Owens, Kayla
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2010, 20 : 53 - 78
  • [4] *-graphs of vertices of the generalized transitive tournament polytope
    Borobia, A
    Chumillas, V
    DISCRETE MATHEMATICS, 1998, 179 (1-3) : 49 - 57
  • [5] Cubic vertex-transitive graphs on up to 1280 vertices
    Potocnik, Primoz
    Spiga, Pablo
    Verret, Gabriel
    JOURNAL OF SYMBOLIC COMPUTATION, 2013, 50 : 465 - 477
  • [6] 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
  • [7] Decompositions of complete graphs into theta graphs with fewer than ten edges
    Blinco, A
    UTILITAS MATHEMATICA, 2003, 64 : 197 - 212
  • [8] Graphs, which orbits contain no more than three vertices
    Latkina, L. P.
    BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS, 2015, 78 (02): : 89 - 98
  • [9] THE CUBICAL D-POLYTOPES WITH FEWER THAN 2(D+1) VERTICES
    BLIND, G
    BLIND, R
    DISCRETE & COMPUTATIONAL GEOMETRY, 1995, 13 (3-4) : 321 - 345
  • [10] Vertices of the generalized transitive tournament polytope
    Borobia, A
    DISCRETE MATHEMATICS, 1997, 163 (1-3) : 229 - 234
12345