Cubic graph: различия между версиями

Текущая версия от 12:35, 19 ноября 2019

This is a regular graph with a vertex degree [math]\displaystyle{ \;3 }[/math].

A graph is called almost cubic (or almost [math]\displaystyle{ \;3 }[/math]-regular) if one of its vertices has degree [math]\displaystyle{ \;3 + e, \; e \geq 0 }[/math], and the others have degree [math]\displaystyle{ \;3 }[/math].

Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.

@@ Строка 3: / Строка 3: @@
 This is a ''[[regular graph]]'' with a [[vertex]] degree <math>\;3</math>.
-A [[graph, undirected graph, nonoriented graph|graph]] is called '''[[almost cubic graph|almost cubic]]''' (or '''[[almost 3-regular|almost <math>\;3</math>-regular]]''') if one of its vertices has degree <math>;3 + e, \; e \geq 0</math>, and the others have degree 3.
+A [[graph, undirected graph, nonoriented graph|graph]] is called '''[[almost cubic graph|almost cubic]]''' (or '''[[almost 3-regular|almost <math>\;3</math>-regular]]''') if one of its vertices has degree <math>\;3 + e, \; e \geq 0</math>, and the others have degree <math>\;3</math>.
 ==Литература==
 * Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.