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 graph is connected when there is a path between every pair of vertices. In a connected graph, there are no unreachable vertices. A graph that is not connected is disconnected. A graph with just one vertex is connected.An edgeless graph with two or more vertices is disconnected. graph is connected when there is a path between every pair of vertices. In a connected graph, there are no unreachable vertices. A graph that is not connected is disconnected. A graph with just one vertex is connected.