Search Results for ""

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

Gaussian primes are Gaussian integers z=a+bi satisfying one of the following properties. 1. If both a and b are nonzero then, a+bi is a Gaussian prime iff a^2+b^2 is an ...

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...

Let N^* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n>=N^*, a complete graph K_4 of one color with ...

The dimension e(G), also called the Euclidean dimension (e.g., Buckley and Harary 1988) of a graph, is the smallest dimension n of Euclidean n-space in which G can be ...

The gyroid, illustrated above, is an infinitely connected periodic minimal surface containing no straight lines (Osserman 1986) that was discovered by Schoen (1970). ...

A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...

Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...

A graph G is a hypotraceable graph if G has no Hamiltonian path (i.e., it is not a traceable graph), but G-v has a Hamiltonian path (i.e., is a traceable graph) for every v ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...