back to playlist

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 `k` is called a ** k‑regular graph** or regular graph of degree

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 disconnected 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.

This page contains text from Wikipedia, the Free Encyclopedia - https://wn.com/Regular_graph

back

Help |
About WN |
Privacy Policy |
Contact |
Feedback |
Jobs |
Students |
Email this page |
Newsletter |

© WN 2021 All Rights Reserved, World News Inc

© WN 2021 All Rights Reserved, World News Inc

- Connect:
- CHAT

×

Share this video with your family and friends