Search Results for ""

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

The circum-orthic triangle DeltaA^'B^'C^' is the circumcevian triangle of a triangle DeltaABC with respect to the orthocenter H (Kimberling 1998, p. 163). The circum-orthic ...

Suppose a line L^' meets sidelines BC, CA, and AB in points A^', B^', and C^', respectively. Let A^('') be the reflection of A^' about the midpoint of segment BC, and ...

The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...

An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...

A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...

A diafix of a string T=s_1s_2...s_N is a substring s_(i+1)...s_(N-i) (0<=i<N/2). It is therefore not a first (prefix) or last (suffix) part of a string, but rather is a ...

Let t be an infinite word over a finite alphabet Sigma. Then there exists a uniformly recurrent infinite word r such that Sub(r) subset= Sub(t), where Sub(w) is the set of ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...