Encyclopedia > H > Haven (graph theory)
Haven (graph theory)
In graph theory, if G is a graph, and k ge 0 is an integer, a haven of order k in G is a function assigning to every set X subseteq V(G) with big|Xbig| < k a vertex set of a component of G bigbackslash X, betabig(Xbig), such that if X subseteq Y subseteq V(G) and big|Ybig| < k, then beta(Y) subseteq beta(X).
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)