Search Results for ""
1481 - 1490 of 2049 for Klein Four GroupSearch Results
The assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.
The word "harmonic" has several distinct meanings in mathematics, none of which is obviously related to the others. Simple harmonic motion or "harmonic oscillation" refers to ...
Any one of the eight Apollonius circles of three given circles is tangent to a circle H known as a Hart circle, as are the other three Apollonius circles having (1) like ...
A heptahedron is a polyhedron with seven faces. Because there are 34 heptahedral graphs, there are 34 topologically distinct convex heptahedra. There are three semiregular ...
Let alpha_i and A_i be algebraic numbers such that the A_is differ from zero and the alpha_is differ from each other. Then the expression ...
A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...
An identity is a mathematical relationship equating one quantity to another (which may initially appear to be different).
The inner Soddy circle is the circle tangent to each of the three mutually tangent circles centered at the vertices of a reference triangle. It has circle function ...
Given a map f from a space X to a space Y and another map g from a space Z to a space Y, a lift is a map h from X to Z such that gh=f. In other words, a lift of f is a map h ...
An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...
...
View search results from all Wolfram sites (23853 matches)

