Search Results for ""

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

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

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...

A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...

The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...

The fractional edge chromatic number of a graph G is the fractional analog of the edge chromatic number, denoted chi_f^'(G) by Scheinerman and Ullman (2011). It can be ...

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...

The rhombic dodecahedral graph is the Archimedean dual graph which is the skeleton of the rhombic dodecahedron (as well as the Bilinski dodecahedron). It is the Levi graph of ...

The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...