Search Results for ""

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

The irrational constant R = e^(pisqrt(163)) (1) = 262537412640768743.9999999999992500... (2) (OEIS A060295), which is very close to an integer. Numbers such as the Ramanujan ...

The Wong graph is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Wong graph has 30 nodes. It has 75 edges, girth 5, diameter 3, chromatic number 4, and is ...

The conjecture made by Belgian mathematician Eugène Charles Catalan in 1844 that 8 and 9 (2^3 and 3^2) are the only consecutive powers (excluding 0 and 1). In other words, ...

The Kampyle of Eudoxus is a curve studied by Eudoxus in relation to the classical problem of cube duplication. It is given by the polar equation r=asec^2theta, (1) and the ...

The knot curve is a quartic curve with implicit Cartesian equation (x^2-1)^2=y^2(3+2y). (1) The x- and y-intercepts are (0,-1), (0,1/2), and (+/-1,0). It has horizontal ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

Various forms of opening and closing bracket-like delimiters are used for a number of distinct notational purposes in mathematics. The most common variants of bracket ...

The rank of a vector bundle is the dimension of its fiber. Equivalently, it is the maximum number of linearly independent local bundle sections in a trivialization. ...