Search Results for ""
1191 - 1200 of 2186 for k Connected GraphSearch Results
An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...
Given a point lattice, a cluster is a group of filled cells which are all connected to their neighbors vertically or horizontally.
Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...
The second blackboard problem in the 1997 film Good Will Hunting asks for all the series-reduced trees (referred to by the alternate term "homeomorphically irreducible trees" ...
Consider a network of n resistors R_i so that R_2 may be connected in series or parallel with R_1, R_3 may be connected in series or parallel with the network consisting of ...
The term "bundle" is an abbreviated form of the full term fiber bundle. Depending on context, it may mean one of the special cases of fiber bundles, such as a vector bundle ...
The word canonical is used to indicate a particular choice from of a number of possible conventions. This convention allows a mathematical object or class of objects to be ...
A constant function is function f(x)=c whose value does not change as its parameters vary. The function graph of a one-dimensional constant function is a straight line. The ...
The cyclic group C_(10) is the unique Abelian group of group order 10 (the other order-10 group being the non-Abelian D_5). Examples include the integers modulo 10 under ...
The cyclic group C_(11) is unique group of group order 11. An example is the integers modulo 11 under addition (Z_(11)). No modulo multiplication group is isomorphic to ...
...
View search results from all Wolfram sites (190815 matches)

