TOPICS
Search

Search Results for ""


1231 - 1240 of 2300 for Edge transitive_graphSearch Results
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 ...
A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...
The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...
The regular icosahedron (often simply called "the" icosahedron) is the regular polyhedron and Platonic solid illustrated above having 12 polyhedron vertices, 30 polyhedron ...
A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...
Intuitively, a model of d-dimensional percolation theory is said to be a Bernoulli model if the open/closed status of an area is completely random. In particular, it makes ...
A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...
The tetragonal antiwedge is the topological class of hexahedron. It has 10 edges and 6 vertices and its faces consist of 4 triangles and 2 quadrilaterals. A tetragonal ...
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 ...
1 ... 121|122|123|124|125|126|127 ... 230 Previous Next

...