El directorio enciclopédico desde la Wikipedia.
|
In mathematics, the word blossom refers to a functional in numerical analysis, and to a special type of subgraph in graph theory. [edit] Numerical analysisIn numerical analysis, a blossom is a functional that can be applied to any polynomial, but is mostly used for Bezier and spline curves and surfaces. The blossom of a polynomial f is often denoted The Blossom of a functional is completely characterised by the three properties:
[edit] Graph theoryIn graph theory, a blossom is a subgraph of a given graph with an odd number of vertices, in which there exists a matching that matches any subset of all but one vertex. Blossoms play a key role in Jack Edmonds' algorithms for maximum matching and minimum weight perfect matching in nonbipartite graphs. In general, a graph with n vertices in which any subset of n-1 vertices has a perfect matching is called a factor-critical graph. A blossom is thus a factor-critical subgraph of any graph. [edit] References
Directorio de Enlaces Directorio dmoz Directorio espejo dmoz Pedro Bernardo |
![\mathcal{B}[f]](http://upload.wikimedia.org/math/4/9/7/497465da693b8975170b346e8e772b20.png)
. = \mathcal{B}[f]\big(\pi(u_1,\dots,u_d)\big)](http://upload.wikimedia.org/math/0/6/9/0699d3cbfdd3b92eb1de42a68c6bd566.png)
, (where 
means any  = s\mathcal{B}[f](\alpha,\dots) + t\mathcal{B}[f](\beta,\dots), ~s,t \in \mathbb{R},](http://upload.wikimedia.org/math/b/f/0/bf0006a19dce86a8c27c1899fc8d0a63.png)
when 
 = f(u)](http://upload.wikimedia.org/math/b/4/2/b4283dad519ba71d2b0b568d0a3e19c2.png)
.