Search Results for ""

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...

The square of a graph is defined as its second graph power. The square of any biconnected graph is Hamiltonian (Fleischner 1974, Skiena 1990, p. 231). Mukhopadhyay (1967) has ...

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...

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

A hyperstring is a simple semi-Hamiltonian acyclic digraph (V,E) with a labeling of the edges in E such that, for all vertices i,j,p,q in V, either pi(i,j)=pi(p,q) or pi(i,j) ...

The condition for isoenergetic nondegeneracy for a Hamiltonian H=H_0(I)+epsilonH_1(I,theta) is |(partial^2H_0)/(partialI_ipartialI_j) (partialH_0)/(partialI_i); ...

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

Grinberg constructed a number of small cubic polyhedral graph that are counterexamples to Tait's Hamiltonian graph conjecture (i.e., that every 3-connected cubic graph is ...