TOPICS
Search

Search Results for ""


1261 - 1270 of 2059 for Star GraphSearch Results
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 ...
The regular icosahedron (often simply called "the" icosahedron) is the regular polyhedron and Platonic solid illustrated above having 12 polyhedron vertices, 30 polyhedron ...
The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...
The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...
The cube is the Platonic solid composed of six square faces that meet each other at right angles and has eight vertices and 12 edges. It is also the uniform polyhedron with ...
A C^*-algebra is a Banach algebra with an antiautomorphic involution * which satisfies (x^*)^* = x (1) x^*y^* = (yx)^* (2) x^*+y^* = (x+y)^* (3) (cx)^* = c^_x^*, (4) where ...
A representation of a C^*-algebra A is a pair (H,phi) where H is a Hilbert space and phi:A->B(H) is a *-homomorphism. (H,phi) is said to be faithful if phi is injective. For ...
A mathematical structure A is said to be closed under an operation + if, whenever a and b are both elements of A, then so is a+b. A mathematical object taken together with ...
A formal description of the constraints on the possible configurations of an experiment which is subject to given conditions. A design is sometimes called an experimental ...
1 ... 124|125|126|127|128|129|130 ... 206 Previous Next

...