Vertex-symmetric generalized Moore graphs

被引：27
作者：
Sampels, M [1 ]
机构：
[1] Univ Essen Gesamthsch, Dept Math & Comp Sci, D-45117 Essen, Germany
来源：
DISCRETE APPLIED MATHEMATICS | 2004年 / 138卷 / 1-2期
关键词：
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 条
[31]   Vertex-transitive graphs that have no Hamilton decomposition [J].
Bryant, Darryn ;
Dean, Matthew .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 114 :237-246
[32]   Vertex transitive graphs from injective linear mappings [J].
Macaj, Martin .
JOURNAL OF ALGEBRAIC COMBINATORICS, 2014, 40 (04) :983-999
[33]   On the number of closed walks in vertex-transitive graphs [J].
Jajcay, Robert ;
Malnic, Aleksander ;
Marusic, Dragan .
DISCRETE MATHEMATICS, 2007, 307 (3-5) :484-493
[34]   Graphs preserving Wiener index upon vertex removal [J].
Knor, Martin ;
Majstorovic, Snjezana ;
Skrekovski, Riste .
APPLIED MATHEMATICS AND COMPUTATION, 2018, 338 :25-32
[35]   Vertex transitive graphs from injective linear mappings [J].
Martin Mačaj .
Journal of Algebraic Combinatorics, 2014, 40 :983-999
[36]   The Hamilton Compression of Highly Symmetric Graphs [J].
Gregor, Petr ;
Merino, Arturo ;
Muetze, Torsten .
ANNALS OF COMBINATORICS, 2024, 28 (02) :379-437
[37]   ON NON-CAYLEY VERTEX-TRANSITIVE GRAPHS AND THE META-CAYLEY GRAPHS [J].
Mwambene, Eric .
QUAESTIONES MATHEMATICAE, 2011, 34 (04) :425-431
[38]   Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales [J].
Christofides, Demetres ;
Markstrom, Klas .
RANDOM STRUCTURES & ALGORITHMS, 2008, 32 (01) :88-100
[39]   New Moore-Like Bounds and Some Optimal Families of Abelian Cayley Mixed Graphs [J].
C. Dalfó ;
M. A. Fiol ;
N. López .
Annals of Combinatorics, 2020, 24 :405-424
[40]   Graphs of degree <24, which are limit graphs for minimal vertex-primitive graphs of type HA [J].
Kostousov, K. V. .
DOKLADY MATHEMATICS, 2013, 87 (01) :31-33
12345