Search Results for ""

A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

Several differing definitions of almost planar (as well as nearly planar) have been used in the literature (cf. Lipton et al. 2016). For example, Gubser (1996) defines an ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

An antimagic graph is a 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 differ.

An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Only connected, bridgeless graphs can have a strong orientation ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...

The star graph S_n of order n, sometimes simply known as an "n-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on n nodes with ...