Search Results for ""
1231 - 1240 of 2012 for Polyhedral graphSearch Results
The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...
A fork of a tree T is a node of T which is the endpoint of two or more branches.
Define the Euler measure of a polyhedral set as the Euler integral of its indicator function. It is easy to show by induction that the Euler measure of a closed bounded ...
A stellation is said to be fully supported if all its included cells are supported, i.e., if all its bottom faces are covered by their adjacent cells. In other words, every ...
The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...
A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].
The Euler formula, sometimes also called the Euler identity (e.g., Trott 2004, p. 174), states e^(ix)=cosx+isinx, (1) where i is the imaginary unit. Note that Euler's ...
The icosahedral group I_h is the group of symmetries of the icosahedron and dodecahedron having order 120, equivalent to the group direct product A_5×Z_2 of the alternating ...
A figurate number which is the sum of two consecutive pyramidal numbers, O_n=P_(n-1)+P_n=1/3n(2n^2+1). (1) The first few are 1, 6, 19, 44, 85, 146, 231, 344, 489, 670, 891, ...
A polyhedron compound is an arrangement of a number of interpenetrating polyhedra, either all the same or of several distinct types, usually having visually attractive ...
...
View search results from all Wolfram sites (12667 matches)

