Search Results for ""

The radius of a graph is the minimum graph eccentricity of any graph vertex in a graph. A disconnected graph therefore has infinite radius (West 2000, p. 71). Graph radius is ...

Graph smoothing, also known as smoothing away or smoothing out, is the process of replacing edges e^'=v_iv_j and e^('')=v_jv_k incident at a vertex v_j of vertex degree 2 by ...

An edge subdivision is the insertion of a new vertex v_j in the middle of an exiting edge e=v_iv_k accompanied by the joining of the original edge endpoints with the new ...

The union G=G_1 union G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with V=V_1 union V_2 and X=X_1 union X_2 (Harary ...

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

700 The great dodecahemicosahedron is the uniform polyhedron with Maeder index 65 (Maeder 1997), Wenninger index 102 (Wenninger 1989), Coxeter index 81 (Coxeter et al. 1954), ...

The great dodecahemidodecahedron is the uniform polyhedron with Maeder index 70 (Maeder 1997), Wenninger index 107 (Wenninger 1989), Coxeter index 86 (Coxeter et al. 1954), ...

The great dodecicosahedron is the uniform polyhedron with Maeder index 63 (Maeder 1997), Wenninger index 101 (Wenninger 1989), Coxeter index 79 (Coxeter et al. 1954), and ...

The great dodecicosidodecahedron is the uniform polyhedron with Maeder index 61 (Maeder 1997), Wenninger index 99 (Wenninger 1989), Coxeter index 77(Coxeter et al. 1954), and ...

A polyhedron compound of the great icosahedron and its dual great stellated dodecahedron most easily constructed by adding the polyhedron vertices of the former to the latter.