Search Results for ""
961 - 970 of 4954 for function graphSearch Results
In his last letter to Hardy, Ramanujan defined 17 Jacobi theta function-like functions F(q) with |q|<1 which he called "mock theta functions" (Watson 1936ab, Ramanujan 1988, ...
A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...
The Janko-Kharaghani-Tonchev graph is a strongly regular graph on 324 vertices and 24786 edges. It has regular parameters (nu,k,lambda,mu)=(324,153,72,72). It is implemented ...
A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).
Lambda_0(phi|m)=(F(phi|1-m))/(K(1-m))+2/piK(m)Z(phi|1-m), where phi is the Jacobi amplitude, m is the parameter, Z is the Jacobi zeta function, and F(phi|m^') and K(m) are ...
Let p run over all distinct primitive ordered periodic geodesics, and let tau(p) denote the positive length of p, then the Selberg zeta function is defined as ...
Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...
The modular group Gamma is the set of all transformations w of the form w(t)=(at+b)/(ct+d), where a, b, c, and d are integers and ad-bc=1. A Gamma-modular function is then ...
Informally, a function f is a one-way function if 1. The description of f is publicly known and does not require any secret information for its operation. 2. Given x, it is ...
The quasiperiodic function defined by d/(dz)lnsigma(z;g_2,g_3)=zeta(z;g_2,g_3), (1) where zeta(z;g_2,g_3) is the Weierstrass zeta function and lim_(z->0)(sigma(z))/z=1. (2) ...
...
View search results from all Wolfram sites (422081 matches)

