Search Results for ""
141 - 150 of 1128 for Centered treeSearch Results
Given any tree T having v vertices of vertex degrees of 1 and 3 only, form an n-expansion by taking n disjoint copies of T and joining corresponding leaves by an n-cycle ...
If r is the inradius of a circle inscribed in a right triangle with sides a and b and hypotenuse c, then r=1/2(a+b-c). (1) A Sangaku problem dated 1803 from the Gumma ...
Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...
The BCI triangle DeltaA^'B^'C^' of a triangle DeltaABC with incenter I is defined by letting A^' be the center of the incircle of DeltaBCI, and similarly defining B^' and ...
The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...
The center of a Neuberg circle.
Concentric circles are circles with a common center. The region between two concentric circles of different radii is called an annulus. Any two circles can be made concentric ...
The Fermat axis is the central line connecting the first and second Fermat points. It has line function l=a(b^2-c^2)(a^2-b^2-bc-c^2)(a^2-b^2+bc-c^2), corresponding to ...
Given a circle C with center O and radius k, then two points P and Q are inverse with respect to C if OP·OQ=k^2. If P describes a curve C_1, then Q describes a curve C_2 ...
Let a cone of opening parameter c and vertex at (0,0,0) intersect a sphere of radius r centered at (x_0,y_0,z_0), with the cone oriented such that its axis does not pass ...
...


