Search Results for ""

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

The mathematical study of the properties of the formal mathematical structures called graphs.

The mapping of a grid of regularly ruled squares onto a cone with no overlap or misalignment. Cone nets are possible for vertex angles of 90 degrees, 180 degrees, and 270 ...

The multiplicity of a multigraph is its maximum edge multiplicity.

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

A 4-state two-dimensional Turing machine invented in the 1980s. The ant starts out on a grid containing black and white cells, and then follows the following set of rules. 1. ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...

A longimeter is a transparent sheet of plastic with a regular grid of lines inclined at an angle of 30 degrees to the sides of the sheet. By counting the number of squares ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...