Search Results for ""

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...

A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...

A curve named and studied by Newton in 1701 and contained in his classification of cubic curves. It had been studied earlier by L'Hospital and Huygens in 1692 (MacTutor ...

Serret's integral is given by int_0^1(ln(x+1))/(x^2+1)dx = 1/8piln2 (1) = 0.272198... (2) (OEIS A102886; Serret 1844; Gradshteyn and Ryzhik 2000, eqn. 4.291.8; Boros and Moll ...

A class is a generalized set invented to get around Russell's antinomy while retaining the arbitrary criteria for membership which leads to difficulty for sets. The members ...

The set difference A\B is defined by A\B={x:x in A and x not in B}. Here, the backslash symbol is defined as Unicode U+2216. The set difference is therefore equivalent to the ...

Draw an initial circle, and arrange six circles tangent to it such that they touch both the original circle and their two neighbors. Then the three lines joining opposite ...

The general sextic equation x^6+a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0=0 can be solved in terms of Kampé de Fériet functions, and a restricted class of sextics can be solved in ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

Seymour conjectured that a graph G of order n with minimum vertex degree delta(G)>=kn/(k+1) contains the kth graph power of a Hamiltonian cycle, generalizing Pósa's ...