Search Results for ""

There are a number of attractive polyhedron compounds consisting of 25 octahedra. These compounds will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 30 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

There are a number of attractive polyhedron compounds consisting of 35 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...

A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...

Two graphs are homeomorphic if there is a graph isomorphism from some graph subdivision of one to some subdivision of the other.

A unit-distance embedding is a graph embedding in which all edges have unit length. A graph possessing a unit-distance embedding in two dimensions is called a unit-distance ...

A product space product_(i in I)X_i is compact iff X_i is compact for all i in I. In other words, the topological product of any number of compact spaces is compact. In ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.

Let G(V,E) be a graph with graph vertices V and graph edges E on n graph vertices without a (k+1)-clique. Then t(n,k)<=((k-1)n^2)/(2k), where t(n,k) is the edge count. (Note ...

Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...