Search Results for ""

A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

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 ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

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, ...

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

The diamond graph is the simple graph on 4 nodes and 5 edges illustrated above (Brandstädt et al. 1987, p. 18). It is isomorphic to the complete tripartite graph K_(1,1,2) ...