Search Results for ""

A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...

Tutte's fragment (Taylor 1997) is the 15-node graph illustrated above (Grünbaum 2003, pp. 358-359 and Fig. 17.1.3). If the graph obtained by adding pendant edges to corners ...

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

A graph is a forbidden subgraph if its presence as a subgraph of a given graph means it is not a member of some family of graphs. For example, a bipartite graph is a graph ...

A graph is a forbidden topological minor (also known as a forbidden homeomorphic subgraph) if its presence as a homeomorphic subgraph of a given graph (i.e., there is an ...

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...

The Moser spindle is the 7-node unit-distance graph illustrated above (Read and Wilson 1998, p. 187). It is sometimes called the Hajós graph (e.g., Bondy and Murty 2008. p. ...

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

The central point in a wheel graph W_n. The hub has degree n-1.

The ABC (atom-bond connectivity) energy of a graph is defined as the graph energy of its ABC matrix, i.e., the sum of the absolute values of the eigenvalues of its ABC matrix.