Search Results for ""

A generalized Vandermonde matrix of two sequences a and b where a is an increasing sequence of positive integers and b is an increasing sequence of nonnegative integers of ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

The great inverted snub icosidodecahedron is the uniform polyhedron with Maeder index 69 (Maeder 1997), Wenninger index 113 (Wenninger 1989), Coxeter index 73 (Coxeter et al. ...

The great snub icosidodecahedron is the uniform polyhedron with Maeder index 57 (Maeder 1997), Wenninger index 116 (Wenninger 1989), Coxeter index 88 (Coxeter et al. 1954), ...

The gyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating one of the pentagonal cupolas of a small rhombicosidodecahedron by 1/10 of a turn. It is ...

A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...

The inverted snub dodecadodecahedron is the uniform polyhedron with Maeder index 60 (Maeder 1997), Wenninger index 114 (Wenninger 1989), Coxeter index 76 (Coxeter et al. ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

There are several different definition of link. In knot theory, a link is one or more disjointly embedded circles in three-space. More informally, a link is an assembly of ...