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 ...

The Pell-Lucas numbers are the V_ns in the Lucas sequence with P=2 and Q=-1, and correspond to the Pell-Lucas polynomial Q_n(1). The Pell-Lucas number Q_n is equal to ...

A pentomino is a 5-polyomino. There are 12 free pentominoes, 18 one-sided pentominoes, and 63 fixed pentominoes. The twelve free pentominoes are known by the letters of the ...

Three-dimensional generalization of the polyominoes to n dimensions. The number of polycubes N(n) composed of n cubes are 1, 1, 2, 8, 29, 166, 1023, ... (OEIS A000162; Ball ...

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 tree having four branches at each node. Quadtrees are used in the construction of some multidimensional databases (e.g., cartography, computer graphics, and image ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a quiet NaN or qNaN is a NaN which is quiet in the sense of rarely signaling a floating-point exception. ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

The mathematical study of combinatorial objects in which a certain degree of order must occur as the scale of the object becomes large. Ramsey theory is named after Frank ...