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 bipartite graph is a graph in which the vertex set can be partitioned into two sets, W and X, so that no two vertices in W share a common edge and no two vertices in X share a common edge. Alternatively, it is a graph with a chromatic number of 2.In a complete bipartite graph, the vertex set is the union of two disjoint sets, W and X, so that every vertex in W is adjacent to every vertex in X but there are no edges within W or X.n undirected graph is a graph in which edges have no orientation. The edge (x, y) is identical to the edge (y, x) , i.e., they are not ordered pairs, but sets {x, y } (or 2-multisets) of vertices. The maximum number of edges in an undirected graph without a loop is n(n â 1)/2.