Search Results for ""

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

The Sierpiński gasket graph of order n is the graph obtained from the connectivity of the Sierpiński sieve. The first few Sierpiński gasket graphs are illustrated above. S_2 ...

The cubeplex graph is the cubic Hamiltonian graph on 12 nodes illustrated above in several embeddings and corresponding to the graph Gamma_1 in Fischer and Little (2001). It ...

The Markström graph is a cubic planar graph on 24 vertices which lacks cycles of length 4 and 8 but contains cycles of length 16. (In particular, it contains cycles of ...

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

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

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

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