Search Results for ""

Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) with the edges of the outer cycle removed. Web graphs are graceful. Precomputed ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...

The Franklin graph is the 12-vertex cubic graph shown above whose embedding on the Klein bottle divides it into regions having a minimal coloring using six colors, thus ...

A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

The Wong graph is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Wong graph has 30 nodes. It has 75 edges, girth 5, diameter 3, chromatic number 4, and is ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

The Fritsch graph is the 9-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The thickness (or depth) t(G) (Skiena 1990, p. 251; Beineke 1997) or theta(G) (Harary 1994, p. 120) of a graph G is the minimum number of planar edge-induced subgraphs P_i of ...