Science Fair Project Encyclopedia
Level structure
In the mathematical subfield of graph theory a level structure of a graph is a partition of the set of vertices into equivalence classes of vertices with the same distance from a given root vertex.
Definition
Given a connected graph G=(V,E) with V the set of vertices and E the set of edges with
the eccentricity of a vertex, for a given vertex v
The partition
with
- L0(v): = v
is called a level structure of G with root v and depth ε(v).
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


