Search Results for ""

A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

The Carlson elliptic integrals, also known as the Carlson symmetric forms, are a standard set of canonical elliptic integrals which provide a convenient alternative to ...

The contact triangle of a triangle DeltaABC, also called the intouch triangle, is the triangle DeltaC_AC_BC_C formed by the points of tangency of the incircle of DeltaABC ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

The Droz-Farny circles are a pair of circles of equal radius obtained by particular geometric constructions. The following amazing property of a triangle, first given by ...

An embedding is a representation of a topological object, manifold, graph, field, etc. in a certain space in such a way that its connectivity or algebraic properties are ...

The polynomials G_n(x;a,b) given by the associated Sheffer sequence with f(t)=e^(at)(e^(bt)-1), (1) where b!=0. The inverse function (and therefore generating function) ...

The harmonic parameter of a polyhedron is the weighted mean of the distances d_i from a fixed interior point to the faces, where the weights are the areas A_i of the faces, ...