Search Results for ""

A tangent vector v_(p)=v_1x_u+v_2x_v is a principal vector iff det[v_2^2 -v_1v_2 v_1^2; E F G; e f g]=0, where e, f, and g are coefficients of the first fundamental form and ...

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...

The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...

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

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

Any triangle that has two equal angle bisectors (each measured from a polygon vertex to the opposite sides) is an isosceles triangle. This theorem is also called the ...

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 Johnson triangle DeltaJ_AJ_BJ_C, a term coined here for the first time, is the triangle formed by the centers of the Johnson circles. It has trilinear vertex matrix ...

The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...