Search Results for ""
1731 - 1740 of 2735 for Corona Graph ProductSearch Results
The direct sum of modules A and B is the module A direct sum B={a direct sum b|a in A,b in B}, (1) where all algebraic operations are defined componentwise. In particular, ...
A function f in C^infty(R^n) is called a Schwartz function if it goes to zero as |x|->infty faster than any inverse power of x, as do all its derivatives. That is, a function ...
A nonzero element x of a ring for which x·y=0, where y is some other nonzero element and the multiplication x·y is the multiplication of the ring. A ring with no zero ...
There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...
A differential k-form is a tensor of tensor rank k that is antisymmetric under exchange of any pair of indices. The number of algebraically independent components in n ...
The following table gives the number of nonadjacent vertex pairs k on graphs of n=1, 2, ... vertices. k counts 1 0, 1, 1, 1, 1, 1, 1, ... 2 0, 0, 1, 2, 2, 2, 2, ... 3 0, 0, ...
Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...
The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not. The second ...
A cubic map is three-colorable iff each interior region is bounded by an even number of regions. A non-cubic map bounded by an even number of regions is not necessarily ...
A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...
...
View search results from all Wolfram sites (163923 matches)

