Search Results for ""

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 uniform great rhombicosidodecahedron U_(67) and Wenninger dual W_(105).

The dual of the uniform great rhombicuboctahedron and Wenninger dual W_(85).

The dual of the great dirhombicosidodecahedron U_(75) and Wenninger dual W_(119).

The dual of the great truncated cuboctahedron U_(20) and Wenninger dual W_(93).

The dual of the great truncated icosidodecahedron U_(68) and Wenninger dual W_(108).

The dual of the great ditrigonal dodecicosidodecahedron U_(42) and Wenninger dual W_(81).

The dual of the great dodecicosidodecahedron U_(61) and Wenninger dual W_(99).

A polyhedron compound in which the great dodecahedron is interior to its dual small stellated dodecahedron.

The dual of the great dodecahemicosahedron U_(65) and Wenninger dual W_(102). When rendered, the small dodecahemicosacron and great dodecahemicosacron appear the same.