Search Results for ""

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

Chvátal defines the term hole to mean "a chordless cycle of length at least four." The restriction "of length at least four" allows use of the term "hole" regardless of if ...

The great cubicuboctahedron is the uniform polyhedron with Maeder index 14 (Maeder 1997), Wenninger index 77 (Wenninger 1989), Coxeter index 50 (Coxeter et al. 1954), and ...

The great dirhombicosidodecahedron is the uniform polyhedron with Maeder index 75 (Maeder 1997), Wenninger index 119 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), ...

The great ditrigonal dodecicosidodecahedron is the uniform polyhedron with Maeder index 42 (Maeder 1997), Wenninger index 81 (Wenninger 1989), Coxeter index 54 (Coxeter et ...

The great rhombihexahedron is the uniform polyhedron with Maeder index 21 (Maeder 1997), Wenninger index 103 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), and ...

The great truncated icosidodecahedron, also called the great quasitruncated icosidodecahedron, is the uniform polyhedron with Maeder index 68 (Maeder 1997), Wenninger index ...

A representation of a group G is a group action of G on a vector space V by invertible linear maps. For example, the group of two elements Z_2={0,1} has a representation phi ...

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

Any real function u(x,y) with continuous second partial derivatives which satisfies Laplace's equation, del ^2u(x,y)=0, (1) is called a harmonic function. Harmonic functions ...