TOPICS
Search

Search Results for ""


721 - 730 of 2063 for Quartic graphSearch Results
A general quintic equation a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0=0 (1) can be reduced to one of the form y^5+b_2y^2+b_1y+b_0=0, (2) called the principal quintic form. Vieta's ...
Unlike quadratic, cubic, and quartic polynomials, the general quintic cannot be solved algebraically in terms of a finite number of additions, subtractions, multiplications, ...
The order n of an algebraic surface is the order of the polynomial defining a surface, which can be geometrically interpreted as the maximum number of points in which a line ...
The "trefoil" curve is the name given by Cundy and Rollett (1989, p. 72) to the quartic plane curve given by the equation x^4+x^2y^2+y^4=x(x^2-y^2). (1) As such, it is a ...
Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...
The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.
A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).
The Miquel configuration is the 6_4 configuration illustrated above. Its Levi graph is the rhombic dodecahedral graph.
A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological ...
An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...
1 ... 70|71|72|73|74|75|76 ... 207 Previous Next

...