Search Results for ""
1441 - 1450 of 13134 for complexity theorySearch Results
The multiplicity of a multigraph is its maximum edge multiplicity.
A section of a graph obtained by finding its intersection with a plane.
An element of order 2 in a group (i.e., an element A of a group such that A^2=I, where I is the identity element).
The integral associated with the Haar measure.
The sporadic group HJ, also denoted J_2.
Related to one another by a homomorphism.
A connection between two or more vertices of a hypergraph. A hyperedge connecting just two vertices is simply a usual graph edge.
A divisor which is not a proper divisor.
For a sequence {a_n}, if a_(n+1)-a_n>0 for n>=x, then a_n is increasing for n>=x. Conversely, if a_(n+1)-a_n<0 for n>=x, then a_n is decreasing for n>=x. If a_n>0 and ...
The number of inward directed graph edges from a given graph vertex in a directed graph.
...
View search results from all Wolfram sites (28442 matches)

