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.
Path. In graph theory, a path in a graph is a sequence of edges which connect a sequence of vertices. A path may be infinite, but a finite path always has a first vertex, called its start vertex, and a last vertex, called its end vertex. Both of them are called terminal vertices of the path. The other vertices in the path are internal vertices. A cycle is a path such that the start vertex and end vertex are the same.