4183
правки
KEV (обсуждение | вклад) Нет описания правки |
KEV (обсуждение | вклад) Нет описания правки |
||
Строка 3: | Строка 3: | ||
This is a ''[[regular graph]]'' with a [[vertex]] degree <math>\;3</math>. | 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. | * Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. |