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.
Every disconnected graph can be split up into a number of connected subgraphs, called components. Subgraph. Let G be a graph with vertex set V(G) and edge-list E(G). A subgraph of G is a graph all of whose vertices belong to V(G) and all of whose edges belong to E(G). path graph is a graph consisting of a single path. The path graph with n vertices is denoted by P n. The following are the examples of path graphs. Note that path graph, P n, has n-1 edges, and can be obtained from cycle graph, C n, by removing any edge.