Locally finite graph

Материал из WEGA
Перейти к навигации Перейти к поиску

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.