Search Results for ""

The (26,8)-Paulus graph having the largest possible graph automorphism group order of all 26-node Paulus graphs (namely 120) is sometimes known as the ...

Define a pebbling move as a transer of two pebbles from one vertex of a graph edge to an adjacent vertex with one of the pebbles being removed in transit as a toll. The ...

A polygonal number of the form n(3n-1)/2. The first few are 1, 5, 12, 22, 35, 51, 70, ... (OEIS A000326). The generating function for the pentagonal numbers is ...

The sequence of Fibonacci numbers {F_n} is periodic modulo any modulus m (Wall 1960), and the period (mod m) is the known as the Pisano period pi(m) (Wrench 1969). For m=1, ...

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

A principal bundle is a special case of a fiber bundle where the fiber is a group G. More specifically, G is usually a Lie group. A principal bundle is a total space E along ...

The pseudosquare L_p modulo the odd prime p is the least nonsquare positive integer that is congruent to 1 (mod 8) and for which the Legendre symbol (L_p/q)=1 for all odd ...

A quasi-cubic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...

The term "quotient" is most commonly used to refer to the ratio q=r/s of two quantities r and s, where s!=0. Less commonly, the term quotient is also used to mean the integer ...