Search Results for ""
741 - 750 of 1332 for 15)Search Results
The Weierstrass zeta function zeta(z;g_2,g_3) is the quasiperiodic function defined by (dzeta(z;g_2,g_3))/(dz)=-P(z;g_2,g_3), (1) where P(z;g_2,g_3) is the Weierstrass ...
A knot property, also called the twist number, defined as the sum of crossings p of a link L, w(L)=sum_(p in C(L))epsilon(p), (1) where epsilon(p) defined to be +/-1 if the ...
A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...
An xyz embedding, also called an "xyz drawing," is a three-dimensional embedding such that every axis-parallel line contains either zero or two vertices. Such an embedding is ...
The Chebyshev polynomials of the first kind are a set of orthogonal polynomials defined as the solutions to the Chebyshev differential equation and denoted T_n(x). They are ...
The decimal expansion of a number is its representation in base-10 (i.e., in the decimal system). In this system, each "decimal place" consists of a digit 0-9 arranged such ...
Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...
A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...
Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...
If there is an integer 0<x<p such that x^2=q (mod p), (1) i.e., the congruence (1) has a solution, then q is said to be a quadratic residue (mod p). Note that the trivial ...
...
View search results from all Wolfram sites (62659 matches)

