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
\epsilon:V \to \mathbb{N}
the eccentricity of a vertex, for a given vertex v The partition
V = \bigcup_{i=0}^{\epsilon(v)} L_i(v)=V
with
L_0(v):={v}
L_i(v):=\mathrm{Adj}(L_{i-1}(x)) \setminus \bigcup_{j=0}^{i-1} L_j(x) \qquad \mbox{ , } i=1,2,\ldots \epsilon(v)
is called a level structure of G with root v and depth ε(v).

 

<< PreviousWord BrowserNext >>
little pee dee river
reiner gamma
ximelagatran
body politic
shackleton (crater)
hialeah market (tri rail station)
olbers (crater)
list of nebraska county name etymologies
alfraganus (crater)
order of the coif
mephisto odyssey
alhazen (crater)
zen theosophy
calgary mustangs
usnh beaufort
long pond
san rafael mountains
tom laughlin (actor)
sidney, new york
aliacensis (crater)
donald bitzer
roswell p. bishop
ministre de revenu du quebec
dharmsamrat paramhans swami madhavananda
london sw2
the hay wain
myrmecinae
.es
holalkere
petra verkaik
korolev (lunar crater)
deep purple in rock
grizzlebee's
deinococcus radiodurans
artivist
patrick dunbar, 9th earl of dunbar
sully, wales
steve stone (baseball player)
nicholas de moels
steam dummy
burn (album)
geno washington
jews by choice
beit din
Copyright 2005-2009 OnPedia.com. All Rights Reserved