Girth 5 Graphs from Elliptic Semiplanes

被引:7
|
作者
Funk, M. [1 ]
机构
[1] Univ Basilicata, Dipartimento Matemat Informat, Viale Ateneo Lucano, I-85100 Potenza, Italy
来源
NOTE DI MATEMATICA | 2009年 / 29卷
关键词
(k; 5)-cages; girth; 5; graphs; elliptic semiplanes; Hughes planes;
D O I
10.1285/i15900932v29n1supplp91
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For 3 <= k <= 20 with k not equal 4, 8, 12, all the smallest currently known k-regular graphs of girth 5 have the same orders as the girth 5 graphs obtained by the following construction: take a (not necessarily Desarguesian) elliptic semiplane S of order n - 1 where n = k - r for some r >= 1; the Levi graph Gamma(S) of S is an n-regular graph of girth 6; parallel classes of S induce co-cliques in Gamma(S), some of which are eventually deleted; the remaining co-cliques are amalgamated with suitable r-regular graphs of girth at least 5. For k > 20, this construction yields some new instances underbidding the smallest orders known so far.
引用
收藏
页码:91 / 113
页数:23
相关论文
共 50 条
  • [31] Girth of pancake graphs
    Compeau, Phillip E. C.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (15) : 1641 - 1645
  • [32] Infinitely many planar cubic hypohamiltonian graphs of girth 5
    Goedgebeur, Jan
    Zamfirescu, Carol T.
    JOURNAL OF GRAPH THEORY, 2018, 88 (01) : 40 - 45
  • [33] ON NON-EXISTENCE OF A TYPE OF REGULAR GRAPHS OF GIRTH 5
    BROWN, WG
    CANADIAN JOURNAL OF MATHEMATICS, 1967, 19 (03): : 644 - &
  • [34] LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g >= 5
    Bu, Yuehua
    Yang, Sheng
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (01)
  • [35] Acyclic edge coloring of planar graphs with girth at least 5
    Hou, Jianfeng
    Wang, Weitao
    Zhang, Xiaoran
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (18) : 2958 - 2967
  • [36] 2-Distance coloring of planar graphs with girth 5
    Wei Dong
    Baogang Xu
    Journal of Combinatorial Optimization, 2017, 34 : 1302 - 1322
  • [37] GRAPHS OF GIRTH 5 AND DIAGRAM GEOMETRIES RELATED TO THE PETERSEN GRAPH
    IVANOV, AA
    DOKLADY AKADEMII NAUK SSSR, 1987, 295 (03): : 529 - 533
  • [38] Girth of sparse graphs
    Bollobás, B
    Szemerédi, E
    JOURNAL OF GRAPH THEORY, 2002, 39 (03) : 194 - 200
  • [39] A CHARACTERIZATION OF WELL COVERED GRAPHS OF GIRTH-5 OR GREATER
    FINBOW, A
    HARTNELL, B
    NOWAKOWSKI, RJ
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 57 (01) : 44 - 68
  • [40] Describing short paths in plane graphs of girth at least 5
    Jendrol', S.
    Macekova, M.
    DISCRETE MATHEMATICS, 2015, 338 (02) : 149 - 158