Search Results for ""

The term "bundle" is an abbreviated form of the full term fiber bundle. Depending on context, it may mean one of the special cases of fiber bundles, such as a vector bundle ...

The R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].

A quantitative measure of the simplicity of a geometric construction which reduces geometric constructions to five steps. It was devised by È. Lemoine. S_1 Place a ...

A Pareto plot is type of plot used in quality control applications that combines a bar chart displaying percentages of categories in the data with a line graph showing ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...

A 15_3 configuration of 15 lines and 15 points, with three lines through three points, three points on every line, and containing no triangles. It is illustrated above in two ...

A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...

The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...

A uniquely Hamiltonian graph is a graph possessing a single Hamiltonian cycle. Classes of uniquely Hamiltonian graphs include the cycle graphs C_n, Hanoi graphs H_n, ladder ...