Search Results for ""

If G is a weighted tree with weights w_i>1 assigned to each vertex v_i, then G is perfectly weighted if the matrix M_G=[w_1 0 ... 0; 0 w_2 ... 0; | ... ... |; 0 0 ... ...

A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

A planted plane tree (V,E,v,alpha) is defined as a vertex set V, edges set E, root v, and order relation alpha on V which satisfies 1. For x,y in V if rho(x)<rho(y), then ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...

There are two completely different definitions of Cayley numbers. The first and most commonly encountered type of Cayley number is the eight elements in a Cayley algebra, ...

In affine three-space the Cayley surface is given by x_3=x_1x_2-1/3x_1^3 (1) (Nomizu and Sasaki 1994). The surface has been generalized by Eastwood and Ezhov (2000) to ...

A plane curve discovered by Maclaurin but first studied in detail by Cayley. The name Cayley's sextic is due to R. C. Archibald, who attempted to classify curves in a paper ...

The only nonassociative division algebra with real scalars. There is an 8-square identity corresponding to this algebra. The elements of a Cayley algebra are called Cayley ...

The 60 Pascal lines of a hexagon inscribed in a conic intersect three at a time through 20 Steiner points, and also three at a time in 60 Kirkman points. Each Steiner point ...