Search Results for ""

Graph Strength

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

An aperiodic tiling is a non-periodic tiling in which arbitrarily large periodic patches do not occur. A set of tiles is said to be aperiodic if they can form only ...

"At least one" is a mathematical term meaning one or more. It is commonly used in situations where existence can be established but it is not known how to determine the total ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

There are a number of graphs associated with J. H. Conway. The first is the unique rank-3 strongly regular graph with parameters (nu,k,lambda,mu)=(1408,567,246,216) with ...

A surface of constant negative curvature obtained by twisting a pseudosphere and given by the parametric equations x = acosusinv (1) y = asinusinv (2) z = ...

A n-dipyramidal graph is the skeleton of an n-sided dipyramid. It is isomorphic to the (m,2)-cone graph C_m+K^__2, where C_m is a cycle graph, K^__2 is the empty graph on 2 ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

A fact noticed by physicist G. Gamow when he had an office on the second floor and physicist M. Stern had an office on the sixth floor of a seven-story building (Gamow and ...