Search Results for ""
4781 - 4790 of 13135 for Multiplicative Number TheorySearch Results
A cubic nonplanar graph is a graph that is both cubic and nonplanar. The following table summarizes some named nonplanar cubic graphs. graph G |V(G)| utility graph 6 Petersen ...
The cyclotomic graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a cube in the finite field GF(q). This graph is ...
An edge cut (Holton and Sheehan 1993, p. 14; West 2000, p. 152), edge cut set, edge cutset (Holton and Sheehan 1993, p. 14), or sometimes simply "cut set" or "cutset" (e.g., ...
A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...
"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...
The Hochberg-O'Donnell fish graph is the unit-distance graph on 23 nodes and 42 edges illustrated above. It is triangle-free and is the smallest example of a unit-distance ...
Jackson's theorem is a statement about the error E_n(f) of the best uniform approximation to a real function f(x) on [-1,1] by real polynomials of degree at most n. Let f(x) ...
The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...
A lattice-ordered set is a poset (L,<=) in which each two-element subset {a,b} has an infimum, denoted inf{a,b}, and a supremum, denoted sup{a,b}. There is a natural ...
A nonassociative algebra obeyed by objects such as the Lie bracket and Poisson bracket. Elements f, g, and h of a Lie algebra satisfy [f,f]=0 (1) [f+g,h]=[f,h]+[g,h], (2) and ...
...
View search results from all Wolfram sites (56265 matches)

