Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles

DOI10.1002/jgt.21837zbMath1328.05097arXiv1210.6342OpenAlexW1913896462WikidataQ56873207 ScholiaQ56873207MaRDI QIDQ2947856

Sandi Klavžar, Jernej Azarija

Publication date: 29 September 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.6342

zbMATH Keywords

extremal graphMoore graphconvex subgraphconvex cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (3)

A proof of the upper matching conjecture for large graphs ⋮ Kissing numbers of regular graphs ⋮ Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approaching the Moore bound for diameter two by Cayley graphs
• Characterizing almost-median graphs. II.
• Search for properties of the missing Moore graph
• Netlike partial cubes, IV: Fixed finite subgraph theorems
• Netlike partial cubes II. Retracts and netlike subgraphs
• Characterization of the Cartesian product of complete graphs by convex subgraphs
• A characterization of the n-cube by convex subgraphs
• Vertex-symmetric generalized Moore graphs.
• Graphs of acyclic cubical complexes
• Distance-preserving subgraphs of hypercubes
• Moore graphs and beyond: a survey of the degree/diameter problem
• Convex excess in partial cubes
• On Moore Graphs with Diameters 2 and 3
• Some properties of the Hoffman-Singleton graph
• The Determinant of the Adjacency Matrix of a Graph
• Isometric subgraphs of Hamming graphs and d-convexity
• Cartesian products of trees and paths
• Roots of cube polynomials of median graphs
• There is No Irregular Moore Graph

This page was built for publication: Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles