Search Results for ""

One of Cantor's ordinal numbers omega, omega+1, omega+2, ..., omega+omega, omega+omega+1, ... which is "larger" than any whole number.

Let graph G have p points v_i and graph H have p points u_i, where p>=3. Then if for each i, the subgraphs G_i=G-v_i and H_i=H-u_i are isomorphic, then the graphs G and H are ...

Let S be a nonempty set, then an ultrafilter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F. 2. If A,B in F, then A ...

An abstract machine that is implemented in software is termed a virtual machine.

A linkage used in the original steam engine to turn back-and-forth motion into approximately straight-line motion.

The utility problem posits three houses and three utility companies--say, gas, electric, and water--and asks if each utility can be connected to each house without having any ...

The n-centipede graph, n-centipede tree, n-comb graph (Seoud and Youssef 2017), or simply "n-centipede," is the tree on 2n nodes obtained by joining the bottoms of n copies ...

An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007). Firecracker graphs are graceful ...

The gem graph is the fan graph F_(4,1) illustrated above. It is implemented in the Wolfram Language as GraphData["GemGraph"].

The Hoffman graph is the bipartite graph on 16 nodes and 32 edges illustrated above that is cospectral to the tesseract graph Q_4 (Hoffman 1963, van Dam and Haemers 2003). ...