Search results
Results From The WOW.Com Content Network
By Vieta's formulas, s 0 is known to be zero in the case of a depressed cubic, and − b / a for the general cubic. So, only s 1 and s 2 need to be computed. They are not symmetric functions of the roots (exchanging x 1 and x 2 exchanges also s 1 and s 2 ), but some simple symmetric functions of s 1 and s 2 are also symmetric in the ...
The graph of any cubic function is similar to such a curve. The graph of a cubic function is a cubic curve, though many cubic curves are not graphs of functions. Although cubic functions depend on four parameters, their graph can have only very few shapes. In fact, the graph of a cubic function is always similar to the graph of a function of ...
According to Brooks' theorem every connected cubic graph other than the complete graph K 4 has a vertex coloring with at most three colors. Therefore, every connected cubic graph other than K 4 has an independent set of at least n/3 vertices, where n is the number of vertices in the graph: for instance, the largest color class in a 3-coloring has at least this many vertices.
Regular graphs of degree at most 2 are easy to classify: a 0-regular graph consists of disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of a disjoint union of cycles and infinite chains. A 3-regular graph is known as a cubic graph.
A cubic graph (all vertices have degree three) of girth g that is as small as possible is known as a g-cage (or as a (3,g)-cage).The Petersen graph is the unique 5-cage (it is the smallest cubic graph of girth 5), the Heawood graph is the unique 6-cage, the McGee graph is the unique 7-cage and the Tutte eight cage is the unique 8-cage. [3]
The 1st equal areas cubic is the locus of a point X such that area of the cevian triangle of X equals the area of the cevian triangle of X*. Also, this cubic is the locus of X for which X* is on the line S*X, where S is the Steiner point. (S = X(99) in the Encyclopedia of Triangle Centers).
Cubic function, a polynomial function of degree three; Cubic equation, a polynomial equation (reducible to ax 3 + bx 2 + cx + d = 0) Cubic form, a homogeneous polynomial of degree 3; Cubic graph (mathematics - graph theory), a graph where all vertices have degree 3; Cubic plane curve (mathematics), a plane algebraic curve C defined by a cubic ...
Petersen's theorem can also be applied to show that every maximal planar graph can be decomposed into a set of edge-disjoint paths of length three. In this case, the dual graph is cubic and bridgeless, so by Petersen's theorem it has a matching, which corresponds in the original graph to a pairing of adjacent triangle faces. Each pair of ...