Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles
Copyright policy )Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles
AbstractLet denote the number of convex cycles of a simple graph G of order n, size m, and girth . It is proved that and that equality holds if and only if G is an even cycle or a Moore graph. The equality also holds for a possible Moore graph of diameter 2 and degree 57 thus giving a new characterization of Moore graphs.
- University of Maribor Slovenia
- University of Ljubljana Slovenia
Extremal problems in graph theory, Distance in graphs, extremal graph, convex cycle, convex subgraph, FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), Moore graph
Extremal problems in graph theory, Distance in graphs, extremal graph, convex cycle, convex subgraph, FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), Moore graph
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!