Search Results for ""

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

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

A group action G×X->X is effective if there are no trivial actions. In particular, this means that there is no element of the group (besides the identity element) which does ...

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

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

Let P be a matrix of eigenvectors of a given square matrix A and D be a diagonal matrix with the corresponding eigenvalues on the diagonal. Then, as long as P is a square ...

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

For any Abelian group G and any natural number n, there is a unique space (up to homotopy type) such that all homotopy groups except for the nth are trivial (including the ...