regular graph

Written by

The Information Architects of Encyclopaedia Britannica

Last updated

July 13, 2026

Quick Summary

A regular graph is a graph where each vertex has the same number of edges connected to it. This number is called the degree of the vertex. For example, a complete graph where every vertex is connected to every other vertex is a regular graph. If a graph has n vertices, each vertex in a complete graph has a degree of n-1.1

Graph theory, the study of these networks of points (vertices) and lines (edges), has applications in various fields like chemistry, computer science, and social sciences. The term "graph" in this context differs from data charts like line or bar graphs.1

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

4 Britannica Sources

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

combinatorics
Characterization problems of graph theory
…G is said to be regular of degree n₁ if each vertex is adjacent to exactly n₁ other vertices. A regular graph of degree n₁ with υ vertices is said to be strongly regular with parameters (υ, n₁, p₁₁¹, p₁₁²) if any two adjacent vertices are both adjacent to exactly…
Read More
…G is said to be regular of degree n₁ if each vertex is adjacent to exactly n₁ other vertices. A regular graph of degree n₁ with υ vertices is said to be strongly regular with parameters (υ, n₁, p₁₁¹, p₁₁²) if any two adjacent vertices are both adjacent to exactly…
Read More