Search Results for ""
1531 - 1540 of 13134 for Order TheorySearch Results
The bull graph is a simple graph on 5 nodes and 5 edges whose name derives from its resemblance to a schematic illustration of a bull or ram (whose face is the triangle and ...
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 ...
The kite graph is the 5-vertex graph illustrated above (Brandstädt et al. 1987, p. 18). It is implemented in the Wolfram Language as GraphData["KiteGraph"]. Unfortunately, ...
The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...
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 ...
An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...
The Miller Institute knot is the 6-crossing prime knot 6_2. It is alternating, chiral, and invertible. A knot diagram of its laevo form is illustrated above, which is ...
The stevedore's knot is the 6-crossing prime knot 6_1. It is implemented in the Wolfram Language as KnotData["Stevedore"]. It has braid word ...
The "contiguous USA graph" is the graph whose vertices represent the contiguous 48 states of the United States plus the District of Columbia (DC) and whose edges connect ...
The Frucht graph is smallest cubic identity graph (Skiena 1990, p. 185). It is implemented in the Wolfram Language as GraphData["FruchtGraph"]. It has 12 vertices and 18 ...
...