Search Results for ""
641 - 650 of 1360 for Tetrahedral GroupSearch Results
1000=10^3. The word "thousand" appears in common expressions in a number of languages, for example, "a thousand pardons" in English and "tusen takk" ("a thousand thanks") in ...
The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward ...
An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...
The theta series of a lattice is the generating function for the number of vectors with norm n in the lattice. Theta series for a number of lattices are implemented in the ...
A highly structured geometric object used to study groups which act upon them.
A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...
The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...
A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...
If O_(p^')(G)=1 and if x is a p-element of G, then L_(p^')(C_G(x))<=E(C_G(x)), where L_(p^') is the p-layer.
Let A^~, B^~, ... be operators. Then the commutator of A^~ and B^~ is defined as [A^~,B^~]=A^~B^~-B^~A^~. (1) Let a, b, ... be constants, then identities include [f(x),x] = 0 ...
...


