Search Results for ""

Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...

The Balaban 10-cage is one of the three (3,10)-cage graphs (Read and Wilson 1998, p. 272). The Balaban (3,10)-cage was the first known example of a 10-cage (Balaban 1973, ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

A regular graph that is edge-transitive but not vertex-transitive is called a semisymmetric graph (Marušič and Potočnik 2001). In contrast, any graph that is both ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

An outerplanar graph is a graph that can be embedded in the plane such that all vertices lie on the outer face. Outerplanar graphs are planar and, by their definition, ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...