Search Results for ""

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

The periphery of a graph G is the subgraph of G induced by vertices that have graph eccentricities equal to the graph diameter. The periphery of a connected graph may be ...

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 ...

A special case of a flag manifold. A Grassmann manifold is a certain collection of vector subspaces of a vector space. In particular, g_(n,k) is the Grassmann manifold of ...

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).