Vertex-symmetric generalized Moore graphs

被引:27
作者
Sampels, M [1 ]
机构
[1] Univ Essen Gesamthsch, Dept Math & Comp Sci, D-45117 Essen, Germany
关键词
Moore bound; degree/diameter problem; transmission; mean distance; Cayley graphs;
D O I
10.1016/S0166-218X(03)00294-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The transmission of a connected graph G is defined as the sum of all distances in G. A lower bound for the transmission, which can be regarded as a generalization of the Moore bound, was derived by Cerf et at. Graphs with a transmission attaining this bound are called generalized Moore graphs. Using techniques founded on Cayley graphs, we constructed vertex-symmetric generalized Moore graphs. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:195 / 202
页数:8
相关论文
共 50 条
[41]   New Moore-Like Bounds and Some Optimal Families of Abelian Cayley Mixed Graphs [J].
Dalfo, C. ;
Fiol, M. A. ;
Lopez, N. .
ANNALS OF COMBINATORICS, 2020, 24 (02) :405-424
[42]   ON TWO GENERALIZED CONNECTIVITIES OF GRAPHS [J].
Sun, Yuefang ;
Li, Fengwei ;
Jin, Zemin .
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (01) :245-261
[43]   On Total Regularity of Mixed Graphs with Order Close to the Moore Bound [J].
James Tuite ;
Grahame Erskine .
Graphs and Combinatorics, 2019, 35 :1253-1272
[44]   On Total Regularity of Mixed Graphs with Order Close to the Moore Bound [J].
Tuite, James ;
Erskine, Grahame .
GRAPHS AND COMBINATORICS, 2019, 35 (06) :1253-1272
[45]   Almost Moore and the largest mixed graphs of diameters two and three [J].
Dalfo, C. ;
Fiol, M. A. ;
Lopez, N. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2024, 693 :374-385
[46]   Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs [J].
Bessy, Stephane ;
Dross, Francois ;
Knor, Martin ;
Skrekovski, Riste .
DISCRETE APPLIED MATHEMATICS, 2020, 284 :195-200
[47]   On the defect of vertex-transitive graphs of given degree and diameter [J].
Exoo, Geoffrey ;
Jajcay, Robert ;
Macaj, Martin ;
Siran, Jozef .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 134 :322-340
[48]   Cubic vertex-transitive graphs on up to 1280 vertices [J].
Potocnik, Primoz ;
Spiga, Pablo ;
Verret, Gabriel .
JOURNAL OF SYMBOLIC COMPUTATION, 2013, 50 :465-477
[49]   Uncountable families of vertex-transitive graphs of finite degree [J].
Leader, I ;
Markström, K .
DISCRETE MATHEMATICS, 2006, 306 (07) :678-679
[50]   Some conditional vertex connectivities of complete-transposition graphs [J].
Wang, Guoliang ;
Shi, Haizhong ;
Hou, Feifei ;
Bai, Yalan .
INFORMATION SCIENCES, 2015, 295 :536-543