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.
Given a connected graph G, a connected subgraph that is botha tree and contains all the vertices of G is called a spanning tree for G.DiscussionGiven a connected graph G, one is often interested in constructing a connectedsubgraph, which contains all of the vertices of G, but has as few the edges of G aspossible. graph is connected if and only if it has a spanning tree.DiscussionOne of the key points of Theorem 5.4.1 is that any connected graph has a spanningtree. A spanning tree of a connected graph can be found by removing any edge thatforms a simple circuit and continuing until no such edge exists.