Search Results for ""

A bicubic nonhamiltonian graph is a bicubic (i.e., bipartite cubic graph) that is nonhamiltonian (i.e., that does not possess a Hamiltonian cycle). Tutte (1971) conjectured ...

The two functions theta(x) and psi(x) defined below are known as the Chebyshev functions. The function theta(x) is defined by theta(x) = sum_(k=1)^(pi(x))lnp_k (1) = ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

Game theory is a branch of mathematics that deals with the analysis of games (i.e., situations involving parties with conflicting interests). In addition to the mathematical ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

The integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. Starting with 1, the sequence would be defined by "1, ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

The McGee graph is a cubic symmetric graph on 24 nodes and 36 edges which is the unique 7-cage graph. It can be constructed as the union of the two leftmost subgraphs ...

The parabolic cylinder functions are a class of functions sometimes called Weber functions. There are a number of slightly different definitions in use by various authors. ...