Search Results for ""

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

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

The pentatope is the simplest regular figure in four dimensions, representing the four-dimensional analog of the solid tetrahedron. It is also called the 5-cell, since it ...

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

Iofinova and Ivanov (1985) showed that there exist exactly five bipartite cubic semisymmetric graphs whose automorphism groups preserves the bipartite parts and acts ...

A letter of the alphabet drawn with doubled vertical strokes is called doublestruck, or sometimes blackboard bold (because doublestruck characters provide a means of ...

An L-algebraic number is a number theta in (0,1) which satisfies sum_(k=0)^nc_kL(theta^k)=0, (1) where L(x) is the Rogers L-function and c_k are integers not all equal to 0 ...

A Moiré pattern is an interference pattern produced by overlaying similar but slightly offset templates. A simple example is obtained by taking two identical ruled ...