Search Results for ""

The dimension e(G), also called the Euclidean dimension (e.g., Buckley and Harary 1988) of a graph, is the smallest dimension n of Euclidean n-space in which G can be ...

The graph tensor product, also called the graph cardinal product (Imrich 1998), graph categorical product, graph conjunction, graph direct product (Hammack et al. 2016), ...

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...

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

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

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

A pretzel graph is a graph with graph genus 3 (West 2000, p. 266). Planar, toroidal graphs, and double-toroidal graphs are therefore not pretzel. Examples of pretzel graphs ...

A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...