# Category:Regular graphs

Here is a list of articles in the Regular graphs category of the Computing portal that unifies foundations of mathematics and computations using computers.

## Pages in category "Regular graphs"

The following 118 pages are in this category, out of 118 total.

### *

- Regular graph
*(computing)*

### 1

- 110-vertex Iofinova-Ivanov graph
*(computing)*

### A

- Andrásfai graph
*(computing)* - Antiprism graph
*(computing)* - Archimedean graph
*(computing)*

### B

- Balaban 10-cage
*(computing)* - Balaban 11-cage
*(computing)* - Barnette–Bosák–Lederberg graph
*(computing)* - Bidiakis cube
*(computing)* - Biggs–Smith graph
*(computing)* - Blanuša snarks
*(computing)* - Brinkmann graph
*(computing)*

### C

- Cage (graph theory)
*(computing)* - Cameron graph
*(computing)* - Chang graphs
*(computing)* - Chvátal graph
*(computing)* - Circulant graph
*(computing)* - Circular coloring
*(computing)* - Clebsch graph
*(computing)* - Complete graph
*(computing)* - Coxeter graph
*(computing)* - Crown graph
*(computing)* - Cube-connected cycles
*(computing)* - Cubic graph
*(computing)* - Cycle graph
*(computing)*

### D

- Dejter graph
*(computing)* - Desargues graph
*(computing)* - Diamond cubic
*(computing)* - Dipole graph
*(computing)* - Distance-regular graph
*(computing)* - Distance-transitive graph
*(computing)* - Double-star snark
*(computing)* - Dürer graph
*(computing)* - Dyck graph
*(computing)*

### E

- Ellingham–Horton graph
*(computing)*

### F

- F26A graph
*(computing)* - Flower snark
*(computing)* - Folded cube graph
*(computing)* - Folkman graph
*(computing)* - Foster cage
*(computing)* - Foster graph
*(computing)* - Frankl–Rödl graph
*(computing)* - Franklin graph
*(computing)* - Frucht graph
*(computing)*

### G

- Generalized Petersen graph
*(computing)* - Gewirtz graph
*(computing)* - Gosset graph
*(computing)* - Grassmann graph
*(computing)* - Gray graph
*(computing)*

### H

- Half-transitive graph
*(computing)* - Hall–Janko graph
*(computing)* - Halved cube graph
*(computing)* - Hamming graph
*(computing)* - Harborth graph
*(computing)* - Harries graph
*(computing)* - Harries–Wong graph
*(computing)* - Heawood graph
*(computing)* - Higman–Sims graph
*(computing)* - Hoffman graph
*(computing)* - Hoffman–Singleton graph
*(computing)* - Holt graph
*(computing)* - Horton graph
*(computing)* - Hypercube graph
*(computing)*

### J

- Johnson graph
*(computing)*

### K

- Klein graphs
*(computing)* - Kneser graph
*(computing)*

### L

- Laves graph
*(computing)* - Livingstone graph
*(computing)* - Ljubljana graph
*(computing)*

### M

- Markström graph
*(computing)* - McGee graph
*(computing)* - McKay–Miller–Širáň graph
*(computing)* - McLaughlin graph
*(computing)* - Meredith graph
*(computing)* - Meringer graph
*(computing)* - Möbius ladder
*(computing)* - Möbius–Kantor graph
*(computing)* - Moore graph
*(computing)*

### N

- Nauru graph
*(computing)* - Null graph
*(computing)*

### O

- Odd graph
*(computing)*

### P

- Paley graph
*(computing)* - Pappus graph
*(computing)* - Perkel graph
*(computing)* - Petersen graph
*(computing)* - Platonic graph
*(computing)* - Prism graph
*(computing)*

### Q

- Quartic graph
*(computing)*

### R

- Ramanujan graph
*(computing)* - Random regular graph
*(computing)* - Robertson graph
*(computing)* - Robertson–Wegner graph
*(computing)* - Rook's graph
*(computing)*

### S

- Schläfli graph
*(computing)* - Semi-symmetric graph
*(computing)* - Shrikhande graph
*(computing)* - Snark (graph theory)
*(computing)* - Strongly regular graph
*(computing)* - Supersingular isogeny graph
*(computing)* - Suzuki graph
*(computing)* - Sylvester graph
*(computing)* - Symmetric graph
*(computing)* - Szekeres snark
*(computing)*

### T

- Table of simple cubic graphs
*(computing)* - Thomsen graph
*(computing)* - Tietze's graph
*(computing)* - Triangle graph
*(computing)* - Tutte 12-cage
*(computing)* - Tutte graph
*(computing)* - Tutte–Coxeter graph
*(computing)*

### U

- Utility graph
*(computing)*

### V

- Vertex-transitive graph
*(computing)*

### W

- Wagner graph
*(computing)* - Walk-regular graph
*(computing)* - Watkins snark
*(computing)* - Wells graph
*(computing)* - Wong graph
*(computing)*

### Z

- Zero-symmetric graph
*(computing)*