Graphs derived from perfect difference sets

被引：0
|
作者：
Erskine, Grahame [1 ]
Fratric, Peter [2 ]
Siran, Jozef [1 ,2 ]
机构：
[1] Open Univ, Milton Keynes MK7 6AA, Bucks, England
[2] Slovak Univ Technol Bratislava, Bratislava, Slovakia
来源：
AUSTRALASIAN JOURNAL OF COMBINATORICS | 2021年 / 80卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We study a family of graphs with diameter two and asymptotically optimal order for their maximum degree, obtained from perfect difference sets. We show that for all known examples of perfect difference sets, the graph we obtain is isomorphic to one of the Brown graphs, a well-known family of graphs in the degree-diameter problem.
引用
收藏
页码：48 / 56
页数：9
相关论文
共 50 条
  • [1] Perfect difference sets constructed from Sidon sets
    Javier Cilleruelo
    Melvyn B. Nathanson
    [J]. Combinatorica, 2008, 28 : 401 - 414
  • [2] Perfect difference sets constructed from Sidon sets
    Cilleruelo, Javier
    Nathanson, Melvyn B.
    [J]. COMBINATORICA, 2008, 28 (04) : 401 - 414
  • [3] PERFECT DIFFERENCE SETS
    SINGER, J
    [J]. TRANSACTIONS OF THE NEW YORK ACADEMY OF SCIENCES, 1966, 28 (07): : 883 - &
  • [4] ON PERFECT DIFFERENCE SETS
    HALBERSTADT, H
    LAXTON, RR
    [J]. QUARTERLY JOURNAL OF MATHEMATICS, 1963, 14 (54): : 86 - &
  • [5] On generalized perfect difference sets constructed from Sidon sets
    Fang, Jin-Hui
    [J]. DISCRETE MATHEMATICS, 2021, 344 (12)
  • [6] DOMINATING SETS IN PERFECT GRAPHS
    CORNEIL, DG
    STEWART, LK
    [J]. DISCRETE MATHEMATICS, 1990, 86 (1-3) : 145 - 164
  • [7] On perfect neighborhood sets in graphs
    Fricke, GH
    Haynes, TW
    Hedetniemi, S
    Hedetniemi, ST
    Henning, MA
    [J]. DISCRETE MATHEMATICS, 1999, 199 (1-3) : 221 - 225
  • [8] NEARLY PERFECT SETS IN GRAPHS
    DUNBAR, JE
    HARRIS, FC
    HEDETNIEMI, SM
    HEDETNIEMI, ST
    MCRAE, AA
    LASKAR, RC
    [J]. DISCRETE MATHEMATICS, 1995, 138 (1-3) : 229 - 246
  • [9] Combinatorial Designs, Difference Sets, and Bent Functions as Perfect Colorings of Graphs and Multigraphs
    V. N. Potapov
    S. V. Avgustinovich
    [J]. Siberian Mathematical Journal, 2020, 61 : 867 - 877
  • [10] COMBINATORIAL DESIGNS, DIFFERENCE SETS, AND BENT FUNCTIONS AS PERFECT COLORINGS OF GRAPHS AND MULTIGRAPHS
    Potapov, V. N.
    Avgustinovich, S. V.
    [J]. SIBERIAN MATHEMATICAL JOURNAL, 2020, 61 (05) : 867 - 877
12345