Search Results for ""

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

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

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