Search Results for ""

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...

A graph embedding, sometimes also called a graph drawing, is a particular drawing of a graph. Graph embeddings are most commonly drawn in the plane, but may also be ...

The (m,q)-Ustimenko graph is the distance-1 or distance-2 graph of the dual polar graph on [C_m(q)] (Brouwer et al. 1989, p. 279). The Ustimenko graph with parameters m and q ...

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...

A graph G is said to be flexible if the vertices of G can be moved continuously so that (1) the distances between adjacent vertices are unchanged, and (2) at least two ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...