Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Moore graph

In graph theory, a Moore graph is a regular graph whose girth (the shortest cycle length) is more than twice its diameter (the distance between the farthest two vertices). If the degree of such a graph is d and its diameter is k, its girth must equal 2k + 1. This is true, for a graph of degree d and diameter k, if and only if its number of vertices (its…

Art, Examples & Overview

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Moore graph. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Examples

12 related topics

Overview

13 related topics

Bounding vertices by degree and diameter

1 related topics

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Bounding vertices by degree and diameter

Examples

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Moore graph

Nodes30
Edges29
Triples95
Avg. degree1.93
Density0.066667
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Moore graph

Top relations

related to References · 58
Moore graph → Alan, Alfréd, American Mathematical Monthly, Azarija, Bibcode, Béla, Cambridge Philosophical Society, Convex Cycles, Cycles Are Extremal Graphs, Dalfó, Development, Faculty, Graduate Texts, Graph Theory, Hoffman, Hungar, IBM Journal, Ito, Its Applications, Jernej
related to Examples · 11
Moore graph → C2n, C5, Damerell, Kn, Moore, Singleton, The, The Hoffman, The Petersen, Therefore, This
related to Moore graphs as cages · 10
Moore graph → At, Choose, Each Moore, In, Instead, Moore, Suppose, Therefore, This, Thus
related to Bounding vertices by degree and diameter · 8
Moore graph → Hoffman, In, Let, Moore, Singleton, Therefore, This, Thus
related to External links · 6
Moore graph → Brouwer, Eric, Haemers, Hoffman-Singleton Theorem, MathWorld, Spectra
is a · 2
Moore graph → cage, regular graph whose girth

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

moore graph graphs diameter girth vertices degree number must cycles singleton 2k possible hoffman order tree level doi mr search

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Moore graphis aregular graph whose girth0.90text
Moore graphis acage0.90text
Moore graphrelated to Bounding vertices by degree and diameterLet0.60section
Moore graphrelated to Bounding vertices by degree and diameterThis0.60section
Moore graphrelated to Bounding vertices by degree and diameterIn0.60section
Moore graphrelated to Bounding vertices by degree and diameterThus0.60section
Moore graphrelated to Bounding vertices by degree and diameterHoffman0.60section
Moore graphrelated to Bounding vertices by degree and diameterSingleton0.60section
Moore graphrelated to Bounding vertices by degree and diameterMoore0.60section
Moore graphrelated to Bounding vertices by degree and diameterTherefore0.60section
Moore graphrelated to ExamplesThe Hoffman0.60section
Moore graphrelated to ExamplesSingleton0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.