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

Let p(n) be the first prime which follows a prime gap of n between consecutive primes. Shanks' conjecture holds that p(n)∼exp(sqrt(n)). Wolf conjectures a slightly different ...

Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...

Doob (1996) defines a stochastic process as a family of random variables {x(t,-),t in J} from some probability space (S,S,P) into a state space (S^',S^'). Here, J is the ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

Trigonometric functions of npi/9 radians for n an integer not divisible by 3 (e.g., 40 degrees and 80 degrees) cannot be expressed in terms of sums, products, and finite root ...

A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...

A two-regular graph is a regular graph for which all local degrees are 2. A two-regular graph consists of one or more (disconnected) cycles. The numbers a_n of two-regular ...

An ungraceful graph is a simple graph that does not possess a graceful labeling, i.e., a graph that is not a graceful graph (Gardner 1972). Such graphs have also been termed ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...