Locally finite graph

Материал из WEGA
Версия от 16:38, 31 мая 2011; Glk (обсуждение | вклад) (Новая страница: «'''Locally finite graph''' --- локально конечный граф. A graph is called '''locally finite''' if every its vertex has a finite degree (valency)…»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)
Перейти к навигации Перейти к поиску

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.