Search Results for ""

The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...

The dual of the great snub dodecicosidodecahedron and Wenninger dual W_(115).

The dual of the great inverted snub icosidodecahedron U_(69) and Wenninger dual W_(116).

The dual of the great retrosnub icosidodecahedron and Wenninger dual W_(117).

The dual of the great truncated icosahedron U_(55) and Wenninger dual W_(95).

A method for predicting the onset of widespread chaos. It is based on the hypothesis that the dissolution of an invariant torus can be associated with the sudden change from ...

A dozen dozen, or the square number 144.

One of the eight convex deltahedra built up from 16 equilateral triangles. It consists of two oppositely faced square pyramids rotated 45 degrees to each other and separated ...

The H-fractal is a fractal constructed by starting with the line segments corresponding to a capital letter H, then iteratively placing smaller H's centered at the top and ...