In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each vertex are equal to each other. A regular graph with vertices of degree is called a ‑regular graph or regular graph of degree . Also, from the handshaking lemma, a regular graph of odd degree will contain an even number of vertices.
Regular graphs of degree at most 2 are easy to classify: A 0-regular graph consists of disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of a disjoint union of cycles and infinite chains.
A 3-regular graph is known as a cubic graph.
A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number l of neighbors in common, and every non-adjacent pair of vertices has the same number n of neighbors in common. The smallest graphs that are regular but not strongly regular are the cycle graph and the circulant graph on 6 vertices.
The complete graph is strongly regular for any .
It is well known that the necessary and sufficient conditions for a regular graph of order to exist are that and that is even.
Proof: As we know a complete graph has every pair of distinct vertices connected to each other by an unique edge. So edges are maximum in complete graph and number of edges are and order here is . So . This is the minimum for a particular . Also note that if any regular graph has order then number of edges are so has to be even. In such case it is easy to construct regular graphs by considering appropriate parameters for circulant graphs.
Let A be the adjacency matrix of a graph. Then the graph is regular if and only if is an eigenvector of A. Its eigenvalue will be the constant degree of the graph. Eigenvectors corresponding to other eigenvalues are orthogonal to , so for such eigenvectors , we have .
There is also a criterion for regular and connected graphs : a graph is connected and regular if and only if the matrix of ones J, with , is in the adjacency algebra of the graph (meaning it is a linear combination of powers of A).
Let G be a k-regular graph with diameter D and eigenvalues of adjacency matrix . If G is not bipartite, then
Fast algorithms exist to enumerate, up to isomorphism, all regular graphs with a given degree and number of vertices.
- Chen, Wai-Kai (1997). Graph Theory and its Engineering Applications. World Scientific. pp. 29. ISBN 978-981-02-1859-1.
- Cvetković, D. M.; Doob, M.; and Sachs, H. Spectra of Graphs: Theory and Applications, 3rd rev. enl. ed. New York: Wiley, 1998.
- Curtin, Brian (2005), "Algebraic characterizations of graph regularity conditions", Designs, Codes and Cryptography, 34 (2–3): 241–248, doi:10.1007/s10623-004-4857-4, MR 2128333.
- 
- Meringer, Markus (1999). "Fast generation of regular graphs and construction of cages" (PDF). Journal of Graph Theory. 30 (2): 137–146. doi:10.1002/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G.
|Wikimedia Commons has media related to Regular graphs.|
- Weisstein, Eric W. "Regular Graph". MathWorld.
- Weisstein, Eric W. "Strongly Regular Graph". MathWorld.
- GenReg software and data by Markus Meringer.
- Nash-Williams, Crispin (1969), Valency Sequences which force graphs to have Hamiltonian Circuits, University of Waterloo Research Report, Waterloo, Ontario: University of Waterloo