uniformly locally finite graph
A is a locally finite graph (http://planetmath.org/LocallyFiniteGraph) such that there exists an such that for every we have that the degree of , also denoted , is at most . In other words there exists an such that for every .
Note that the examples provided in locally finite graph (http://planetmath.org/LocallyFiniteGraph) are also examples of a uniformly locally finite graph since both graphs are regular (http://planetmath.org/RegularGraph) and have finite degree (http://planetmath.org/Degree7) at each vertex.
|Title||uniformly locally finite graph|
|Date of creation||2013-03-22 16:00:54|
|Last modified on||2013-03-22 16:00:54|
|Last modified by||sjm1979 (13837)|