Regular graph
Graph where each vertex has the same number of neighbors
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.
Nº Q826467 ★
Common · Knowledge
Regular graph
Graph where each vertex has the same number of neighbors
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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 k is called a k‑regular graph or regular graph of degree k.
Text: Wikipédia, CC BY-SA 4.0. · Image: Wikimedia Commons (CC BY-SA 3.0) ·
Related cards
-
Strongly regular graph
Graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent
Nº Q692823 ★
Not listed
-
Complete graph
Simple undirected graph in which every pair of distinct vertices is connected by a unique edge
Nº Q45715 ★
Not listed
-
Graph coloring
Assignment of colors to elements of a graph subject to certain constraints
Nº Q504843 ★★
Not listed
-
Graph theory
Study of graphs, which are mathematical structures used to model pairwise relations between objects
Nº Q131476 ★★★★
Not listed
-
Adjacency list
Data structure representing a graph
Nº Q264398 ★
Not listed
-
Cycle (graph theory)
In graph theory, non-empty trail in which only the first and last vertices are equal
Nº Q245595 ★★
Not listed