Search Results for ""

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

Efron's dice are set of four nontransitive dice such that the probabilities of A winning against B, B against C, C against D, and D against A are all the same. The images ...

The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...

A number n is called an Egyptian number if it is the sum of the denominators in some unit fraction representation of a positive whole number not consisting entirely of 1s. ...

An illusion studied by the psychologist Walter Ehrenstein in which the sides of a square placed inside a pattern of concentric circles take an apparent curved shape. The name ...

Consider a point P inside a reference triangle DeltaABC, construct line segments AP, BP, and CP. The Ehrmann congruent squares point is the unique point P such that three ...

Let T be a central triangle and let U(T) be its unary cofactor triangle. Then T and U(T) are perspective, and their perspector is called the eigencenter of T. Let the A-, B-, ...

The surface of revolution given by the parametric equations x(u,v) = cosusin(2v) (1) y(u,v) = sinusin(2v) (2) z(u,v) = sinv (3) for u in [0,2pi) and v in [-pi/2,pi/2]. It is ...

A family of functors H_n(·) from the category of pairs of topological spaces and continuous maps, to the category of Abelian groups and group homomorphisms satisfies the ...