Search Results for ""
131 - 140 of 272 for Chord diagramSearch Results
Given two normal subgroups G_1 and G_2 of a group, and two normal subgroups H_1 and H_2 of G_1 and G_2 respectively, H_1(G_1 intersection H_2) is normal in H_1(G_1 ...
The curve given by the polar equation r=a(1-costheta), (1) sometimes also written r=2b(1-costheta), (2) where b=a/2. The cardioid has Cartesian equation ...
In the algebraic geometry of Grothendieck, a stack refers to a sheaf of categories. In particular, a stack is a presheaf of categories in which the following descent ...
An abstract algebra concerned with results valid for many different kinds of spaces. Modules are the basic tools used in homological algebra.
The region lying between two concentric circles. The area of the annulus formed by two circles of radii a and b (with a>b) is A_(annulus)=pi(a^2-b^2). The annulus is ...
A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...
In the figure above with tangent line PT and secant line PA, (PA)/(PT)=(PT)/(PB) (1) (Jurgensen et al. 1963, p. 346). The line tangent to a circle of radius a centered at ...
A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...
The generalization of a Voronoi polygon to n dimensions for n>2.
A polygon which has both a circumcircle (which touches each vertex) and an incircle (which is tangent to each side). All triangles are bicentric with R^2-x^2=2Rr, (1) where R ...
...
View search results from all Wolfram sites (2371 matches)

