Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
Combinatorics
Coding theory Network design |
| gptkbp:definedIn |
A graph where each vertex has the same degree
|
| gptkbp:degree |
k-regular if every vertex has degree k
|
| gptkbp:example |
Complete graph
Cubic graph Cycle graph |
| gptkbp:field |
gptkb:Graph_theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Regular graph
|
| gptkbp:notation |
k-regular graph
|
| gptkbp:property |
All vertices have equal degree
If k=0, the graph is edgeless If k=1, the graph is a matching If k=n-1, the graph is complete The sum of degrees equals 2 times the number of edges |
| gptkbp:relatedConcept |
Bipartite regular graph
Strongly regular graph Vertex-transitive graph |
| gptkbp:studiedBy |
gptkb:Leonhard_Euler
|
| gptkbp:bfsParent |
gptkb:Random_regular_graph
|
| gptkbp:bfsLayer |
8
|