Moore graph
Moore graph
Regular graph with girth more than twice its diameter.
No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.
No owners yet
Category: Empty
- 0 owners
- 0 copies
- 0 pulls
- Wishlisted
- 0
- In 0 albums
- On 0 showcases
- Market listings
- 0
Not sold on the market yet.
Readers' pathsAug 2026 – Oct 2026
Readers go next to
Share of the 255 clicks on its links
Hoffman–Singleton graph
7-regular undirected graph with 50 nodes and 175 edges.
18%
Petersen graph
Cubic graph with 10 vertices and 15 edges.
12%
Degree diameter problem
Extremal graph problem with bounded degree and diameter.
9%
Cage (graph theory)
Regular graph with fewest possible nodes for its girth.
8.2%
Regular graph
Graph where each vertex has the same number of neighbors.
5.1%
Degree (graph theory)
Number of edges touching a vertex in a graph.
3.9%
Strongly regular graph
Concept in graph theory.
3.9%
Readers come from
Share of the 213 readers arriving from another article
Hoffman–Singleton graph
7-regular undirected graph with 50 nodes and 175 edges.
29%
Sierpiński curve
Recursively defined sequence of continuous closed plane fractal curves.
18%
Moore neighborhood
Cellular automaton neighborhood consisting of eight adjacent cells.
16%
Degree diameter problem
Extremal graph problem with bounded degree and diameter.
13%
Regular graph
Graph where each vertex has the same number of neighbors.
9.4%
Cage (graph theory)
Regular graph with fewest possible nodes for its girth.
6.1%