This essential oil has been used for almost 100 years in Australia but is now available worldwide both as neat oil and as an active component in an array of products. The primary uses of tea tree oil have historically capitalized on the antiseptic and anti-inflammatory actions of the oil.
A computer graph is a graph in which every two distinct vertices are joined by exactly one edge. The complete graph with n vertices is denoted by Kn. The following are the examples of complete graphs. The graph Kn is regular of degree n-1, and therefore has 1/2n(n-1) edges, by consequence 3 of the handshaking lemma.
The unique regular hexahedron is the cube, and there are two hexahedra that can be built from regular polygons with equal edge lengths: the regular triangular dipyramid the pentagonal pyramid. Through graph duality, the list of numbers of vertices for each polyhedron in a hexahedron corresponds to the degree sequence (sequence of vertex degrees) of a hexahedral graph. The following table lists the hexahedra, together with their degree sequences, number of vertices , and number of edges , which are related through the polyhedral formula.