Locally finite graph: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Locally finite graph''' --- локально конечный граф. A graph is called '''locally finite''' if every its vertex has a finite degree (valency)…») |
(нет различий)
|
Текущая версия от 09:38, 31 мая 2011
Locally finite graph --- локально конечный граф.
A graph is called locally finite if every its vertex has a finite degree (valency). In other words, a graph is locally finite if every vertex has a finite indegree and outdegree.
A graph is called almost locally finite if only finitely many of its vertices have infinite degrees.