Regular graphs

simple undirected graph in which every pair of distinct vertices is connected by a unique edge

graph where each vertex has the same number of neighbors

cubic graph with 10 vertices and 15 edges

graph that consists of a single cycle

graph in which every vertex is incident to exactly three edges

undirected graph with 14 vertices, 21 edges, and girth 6

the unique graph having no vertices

type of graph which admit an automorphism on adjacent vertices

connected, bridgeless cubic graph with chromatic index equal to 4

graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent

type of mathematical graph

node-link graph of elements of a finite field, adjacent when their difference is a quadratic residue

node-link graph with 50 vertices and 175 edges, the smallest possible 7-regular graph of girth 5

cubic crystal structure of diamond and other substances

graph where any two nodes of equal distance are isomorphic

graph whose automorphism group acts transitively upon its vertices

graph representing disjointness between k-element subsets of an n-element set

highly symmetric graph with 20 vertices and 30 edges

regular graph that has as few vertices as possible for its girth

graph that is edge-transitive and regular but not vertex-transitive

spectral graph theory concept

largest possible regular graph for its diameter

a triangle-free 4-regular 4-chromatic graph with 12 vertices and 24 edges

graphs formed by a hypercube's edges and vertices

cubic circulant graph

graph with 20 vertices and 40 edges, the smallest semi-symmetric graph

cubic graph with 12 vertices and 18 edges

one of three 12-regular graphs with 28 vertices and 168 edges

complete graph on 3 vertices

cubic distance-regular graph with 28 vertices and 42 edges

graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration

one of two different regular graphs with 16 vertices

a regular graph such that for any two vertices v and w, the number of vertices at distance j from v and at distance k from w depends only upon j, k

asymmetric cubic planar graph with 12 vertices and 18 edges

graph with 24 vertices and 36 edges

highly-symmetric node-link graph with 100 vertices and 22 edges per vertex

undirected bipartite graph with 112 vertices and 168 edges

node-link graph with 24 vertices, one of seven symmetric generalized Petersen graphs

node-link graph, the only cubic symmetric graph on 32 vertices

undirected bipartite graph with 54 vertices and 81 edges

cubic graph with 12 vertices and 18 edges

cubic graph with 46 vertices and 69 edges

cubic graph with 102 vertices and 153 edges

bipartite 3-regular graph with 90 vertices and 135 edges

type of graph

graph that is both vertex-transitive and edge-transitive, but not symmetric

graph with 50 vertices and 75 edges

graph with 27 vertices and 54 edges, the smallest half-transitive graph

strongly regular graph with 16 vertices and 48 edges

symmetric bipartite cubic graph with 16 vertices and 24 edges

class of undirected graphs defined from systems of sets

undirected graph acted on by a vertex-transitive cyclic group of symmetries

16-regular graph with 27 vertices and 216 edges

infinite family of graphs

symmetric bipartite cubic graph with 26 vertices and 39 edges

graph with 30 vertices and 45 edges

graph that represents all legal moves of the rook chess piece on a chessboard

strongly regular graph with 56 vertices and valency 10

cubic graph with 70 vertices and 105 edges

highly symmetric cubic graph with 30 vertices and 45 edges