Regular graph

Template:Short description Template:Refimprove Template:Graph families defined by their automorphisms 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 internal vertex are equal to each other. A regular graph with vertices of degree Template:Mvar is called a Template:Nowrap graph or regular graph of degree Template:Mvar.

Special cases

Regular graphs of degree at most 2 are easy to classify: a Template:Nowrap graph consists of disconnected vertices, a Template:Nowrap graph consists of disconnected edges, and a Template:Nowrap graph consists of a disjoint union of cycles and infinite chains.

A Template:Nowrap 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 Template:Mvar of neighbors in common, and every non-adjacent pair of vertices has the same number Template:Mvar 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 Template:Mvar is strongly regular for any Template:Mvar.

• 
  0-regular graph
• 
  1-regular graph
• 
  2-regular graph
• 
  3-regular graph

Existence

The necessary and sufficient conditions for a $k$-regular graph of order $n$ to exist are that $n\ge k+1$ and that $nk$ is even.

Proof: A complete graph has every pair of distinct vertices connected to each other by a unique edge. So edges are maximum in complete graph and number of edges are $(\genfrac{}{}{0ex}{}{n}{2})=\frac{n(n-1)}{2}$ and degree here is $n-1$. So $k=n-1,n=k+1$. This is the minimum $n$ for a particular $k$. Also note that if any regular graph has order $n$ then number of edges are $\frac{nk}{2}$ so $nk$ has to be even. In such case it is easy to construct regular graphs by considering appropriate parameters for circulant graphs.

Properties

From the handshaking lemma, a Template:Mvar-regular graph with odd Template:Mvar has an even number of vertices.

A theorem by Nash-Williams says that every Template:Nowrap graph on Template:Math vertices has a Hamiltonian cycle.

Let A be the adjacency matrix of a graph. Then the graph is regular if and only if $\mathbf{\text{j}}=(1,\dots ,1)$ is an eigenvector of A. Its eigenvalue will be the constant degree of the graph. Eigenvectors corresponding to other eigenvalues are orthogonal to $\mathbf{\text{j}}$, so for such eigenvectors $v=(v_1,\dots ,v_n)$, we have $\sum _{i=1}^n{v}_i=0$.

A regular graph of degree k is connected if and only if the eigenvalue k has multiplicity one. The "only if" direction is a consequence of the Perron–Frobenius theorem.

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 $J_{ij}=1$, 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 $k={\lambda }_0>{\lambda }_1\ge \cdots \ge {\lambda }_{n-1}$. If G is not bipartite, then

$D\le \frac{\log (n-1)}{\log ({\lambda }_0/{\lambda }_1)}+1.$

Generation

Fast algorithms exist to generate, up to isomorphism, all regular graphs with a given degree and number of vertices.

See also

• Random regular graph
• Strongly regular graph
• Moore graph
• Cage graph
• Highly irregular graph

External links

• Template:MathWorld
• Template:MathWorld
• GenReg software and data by Markus Meringer.
• Template:Citation