Search Results for ""

A number of attractive cube 10-compounds can be constructed. The first can be obtained by beginning with an initial cube and rotating it by an angle theta=sin^(-1)(sqrt(3/8)) ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

Ede (1958) enumerates 13 basic series of stellations of the rhombic triacontahedron, the total number of which is extremely large. Pawley (1973) gave a set of restrictions ...

There are two definitions of the supersingular primes: one group-theoretic, and the other number-theoretic. Group-theoretically, let Gamma_0(N) be the modular group Gamma0, ...

The triangle of numbers A_(n,k) given by A_(n,1)=A_(n,n)=1 (1) and the recurrence relation A_(n+1,k)=kA_(n,k)+(n+2-k)A_(n,k-1) (2) for k in [2,n], where A_(n,k) are shifted ...

A formula for numerical integration, (1) where C_(2n) = sum_(i=0)^(n)f_(2i)cos(tx_(2i))-1/2[f_(2n)cos(tx_(2n))+f_0cos(tx_0)] (2) C_(2n-1) = ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

Consider the consecutive number sequences formed by the concatenation of the first n positive integers: 1, 12, 123, 1234, ... (OEIS A007908; Smarandache 1993, Dumitrescu and ...

One form of van der Waerden's theorem states that for all positive integers k and r, there exists a constant n(r,k) such that if n_0>=n(r,k) and {1,2,...,n_0} subset C_1 ...