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.
A tree is a connected acyclic graph. Thus each component of a forest is tree, and any tree is a connected forest. Theorem The following are equivalent in a graph G with n vertices. 1  G is a tree. 2  There is a unique path between every pair of vertices in G. 3  G is connected, and every edge in G is a bridge.4  G is connected, and it has (n - 1) edges. 5  G is acyclic, and it has (n - 1) edges.6  G is acyclic, and whenever any two arbitrary nonadjacent vertices in G are ...heorem The following are equivalent in a graph G with n vertices. 1  G is a tree. 2  There is a unique path between every pair of vertices in G. 3  G is connected, and every edge in G is a bridge. 4  G is connected, and it has (n - 1) edges. 5  G is acyclic, and it has (n - 1) edges. 6  G is acyclic, and whenever any two arbitrary nonadjacent vertices in G are ...