Regular graph
Graph where each vertex has the same number of neighbors / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Regular graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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.[1] A regular graph with vertices of degree k is called a k‑regular graph or regular graph of degree k. Also, from the handshaking lemma, a regular graph contains an even number of vertices with odd degree.
This article needs additional citations for verification. (November 2022) |
Quick Facts Graph families defined by their automorphisms, → ...
Close