Vertex-symmetric generalized Moore graphs.

DOI10.1016/S0166-218X(03)00294-4zbMath1034.05019MaRDI QIDQ1428565

Michael Sampels

Publication date: 29 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Cayley graphsMoore boundDegree/diameter problemMean distanceTransmission

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)

Related Items (11)

The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Length two path-centred surface areas for the arrangement graph ⋮ Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles ⋮ On almost distance-regular graphs ⋮ Pairings and related symmetry notions ⋮ Length two path centered surface areas of the \((n, k)\)-star graph ⋮ Distance-balanced graphs: symmetry conditions ⋮ On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs ⋮ On the surface area of the \((n,k)\)-star graph ⋮ On the Surface Area of the (n, k)-Star Graph ⋮ ON THE SURFACE AREAS AND AVERAGE DISTANCES OF MESHES AND TORI

Cites Work

• The groups of order at most 1000 except 512 and 768
• Maximal cubic graphs with diameter 4
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• On Moore Graphs with Diameters 2 and 3
• A lower bound on the average shortest path length in regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex-symmetric generalized Moore graphs.