Search Results for ""

The graph strong product, also known as the graph AND product or graph normal product, is a graph product variously denoted G□AdjustmentBox[x, BoxMargins -> {{-0.65, ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

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 snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and ...

A heptahedral graph is a polyhedral graph on seven nodes. There are 34 nonisomorphic heptahedral graphs, as first enumerated by Kirkman (1862-1863) and Hermes (1899ab, 1900, ...

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