Skip to main

Mathematics (thesaurus)

Search from vocabulary

Concept information

graph theory > graph > regular graph

Término preferido

regular graph  

Definición

  • 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. Also, from the handshaking lemma, a regular graph contains an even number of vertices with odd degree.
    (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Regular_graph)

Concepto genérico

En otras lenguas

URI

http://data.loterre.fr/ark:/67375/PSR-NNM3SBTX-L

Descargue este concepto:

RDF/XML TURTLE JSON-LD última modificación 18/10/24