Search Results for ""

The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...

The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...

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

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

Any link can be represented by a closed braid.

The number of empty neighbors of a cluster.

A graph cycle.

e is transcendental.