Search Results for ""
1611 - 1620 of 2300 for Edge transitive_graphSearch Results
A tetrahedron having a trihedron all of the face angles of which are right angles. The face opposite the vertex of the right angles is called the base. If the edge lengths ...
The trivial group, denoted E or <e>, sometimes also called the identity group, is the unique (up to isomorphism) group containing exactly one element e, the identity element. ...
A truncated polyhedron is a polyhedron with truncated faces, given by the Schläfli symbol t{p; q}. The operation implemented as Truncate[polyhedron, r] in the Wolfram ...
Truncation is the removal of portions of solids falling outside a set of symmetrically placed planes. The operation implemented as Truncate[polyhedron, r] in the Wolfram ...
Let L denote the n×n triangular lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L ...
The equation of motion for a membrane shaped as a right isosceles triangle of length c on a side and with the sides oriented along the positive x and y axes is given by where ...
A kit consisting of colored rods and slotted balls that can be used to construct three-dimensional configurations. The balls into which the rods are placed resemble an ...
A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...
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 point in a weighted tree that has minimum weight for the tree. The set of all centroid points is called a tree centroid (Harary 1994, p. 36). The largest possible values ...
...
View search results from all Wolfram sites (15428 matches)

