Search Results for ""
1171 - 1180 of 2186 for k Connected GraphSearch Results
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...
A C^infty function is a function that is differentiable for all degrees of differentiation. For instance, f(x)=e^(2x) (left figure above) is C^infty because its nth ...
A group generated by the elements P_i for i=1, ..., n subject to (P_iP_j)^(M_(ij))=1, where M_(ij) are the elements of a Coxeter matrix. Coxeter used the notation [3^(p,q,r)] ...
A 15_3 configuration of 15 lines and 15 points, with three lines through three points, three points on every line, and containing no triangles. It is illustrated above in two ...
A number of attractive 12-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...
A tetraview is a visualization technique for bivariate complex functions. In the simplest case, the graph of a complex-valued function w=w(z) can be considered as a ...
Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...
Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...
A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...
A state diagram is a labeled directed graph together with state information that can be used to indicate that certain paths on in a system may be traversed only in a certain ...
...
View search results from all Wolfram sites (190815 matches)

