Search Results for ""

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...

A number which can be represented by a finite number of additions, subtractions, multiplications, divisions, and finite square root extractions of integers. Such numbers ...

The set of roots of a polynomial f(x,y,z)=0. An algebraic surface is said to be of degree n=max(i+j+k), where n is the maximum sum of powers of all terms ...

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

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

An isolated singularity is a singularity for which there exists a (small) real number epsilon such that there are no other singularities within a neighborhood of radius ...

A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...