Search Results for ""
2391 - 2400 of 2910 for Integer complexitySearch Results
Two circles may intersect in two imaginary points, a single degenerate point, or two distinct points. The intersections of two circles determine a line known as the radical ...
A portion of a disk whose upper boundary is a (circular) arc and whose lower boundary is a chord making a central angle theta<pi radians (180 degrees), illustrated above as ...
Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...
Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...
Clebsch-Gordan coefficients are mathematical symbol used to integrate products of three spherical harmonics. Clebsch-Gordan coefficients commonly arise in applications ...
The (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...
A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...
The nesting of two or more functions to form a single new function is known as composition. The composition of two functions f and g is denoted f degreesg, where f is a ...
Connect-Four is a tic-tac-toe-like two-player game in which players alternately place pieces on a vertical board 7 columns across and 6 rows high. Each player uses pieces of ...
A series is said to be convergent if it approaches some limit (D'Angelo and West 2000, p. 259). Formally, the infinite series sum_(n=1)^(infty)a_n is convergent if the ...
...
View search results from all Wolfram sites (340627 matches)

