Edge-regular graphs with regular cliques

被引:8
|
作者
Greaves, Gary R. W. [1 ]
Koolen, Jack H. [2 ]
机构
[1] Nanyang Technol Univ, Sch Phys & Math Sci, 21 Nanyang Link, Singapore 637371, Singapore
[2] Univ Sci & Technol China, Sch Math Sci, Wen Tsun Wu Key Lab, CAS, Hefei 230026, Anhui, Peoples R China
基金
中国国家自然科学基金;
关键词
D O I
10.1016/j.ejc.2018.04.004
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We exhibit infinitely many examples of edge-regular graphs that have regular cliques and that are not strongly regular. This answers a question of Neumaier from 1981. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:194 / 201
页数:8
相关论文
共 50 条
  • [41] Edge regular intuitionistic fuzzy soft graphs
    Shahzadi, Sundas
    Akram, Muhammad
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2016, 31 (03) : 1881 - 1895
  • [42] Super Restricted Edge Connectivity of Regular Graphs
    Ou Jianping
    Fuji Zhang
    Graphs and Combinatorics, 2005, 21 : 459 - 467
  • [43] On r-Edge Regular Neutrosophic Graphs
    Kaviyarasu M.
    Neutrosophic Sets and Systems, 2023, 53 : 239 - 250
  • [44] ON EDGE-GRACEFUL REGULAR GRAPHS AND TREES
    CABANISS, S
    LOW, R
    MITCHEM, J
    ARS COMBINATORIA, 1992, 34 : 129 - 142
  • [45] Edge colorings and circular flows on regular graphs
    Mattiolo, Davide
    Steffen, Eckhard
    JOURNAL OF GRAPH THEORY, 2022, 99 (03) : 399 - 413
  • [46] Extremal Edge-Girth-Regular Graphs
    Ajda Zavrtanik Drglin
    Slobodan Filipovski
    Robert Jajcay
    Tom Raiman
    Graphs and Combinatorics, 2021, 37 : 2139 - 2154
  • [47] Strongly regular edge-transitive graphs
    Morris, Joy
    Praeger, Cheryl E.
    Spiga, Pablo
    ARS MATHEMATICA CONTEMPORANEA, 2009, 2 (02) : 137 - 155
  • [48] Matching and edge-connectivity in regular graphs
    O, Suil
    West, Douglas B.
    EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (02) : 324 - 329
  • [49] Edge coloring regular graphs of high degree
    Perkovic, L
    Reed, B
    DISCRETE MATHEMATICS, 1997, 165 : 567 - 578
  • [50] Extremal Edge-Girth-Regular Graphs
    Drglin, Ajda Zavrtanik
    Filipovski, Slobodan
    Jajcay, Robert
    Raiman, Tom
    GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2139 - 2154