Search Results for ""

The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...

A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...

The pentatope is the simplest regular figure in four dimensions, representing the four-dimensional analog of the solid tetrahedron. It is also called the 5-cell, since it ...

A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

There are several definitions of the strength of a graph. Harary and Palmer (1959) and Harary and Palmer (1973, p. 66) define the strength of a tree as the maximum number of ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

The n-double cone graph is the name given in the work to the graphs that geometrically correspond to a double cone obtained by connecting all vertices of two C_n cycle graphs ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...