Search Results for ""

Dynamical Systems

Barnette's conjecture asserts that every 3-connected bipartite cubic planar graph is Hamiltonian. The only graph on nine or fewer vertices satisfying Barnette's conditions is ...

A bicubic graph is a bipartite cubic graph. Tutte (1971) conjectured that all 3-connected bicubic graphs are Hamiltonian (the Tutte conjecture), but a number of bicubic ...

A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...

If f(z) is analytic in some simply connected region R, then ∮_gammaf(z)dz=0 (1) for any closed contour gamma completely contained in R. Writing z as z=x+iy (2) and f(z) as ...

A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...