Evolution Module. 6.1 Phylogenetic Trees. Bob Gardner and Lev Yampolski. Integrated Biology and Discrete Math (IBMS 1300)
|
|
- Jonas Bridges
- 6 years ago
- Views:
Transcription
1 Evolution Module 6.1 Phylogenetic Trees Bob Gardner and Lev Yampolski Integrated Biology and Discrete Math (IBMS 1300) Fall
2 INDUCTION Note. The natural numbers N is the familiar set N = {1, 2, 3,...}. From the formal definition of N, we have the following: The Principle of Mathematical Induction. Let S N have the properties: (i) 1 S. (ii) For all n N, ifn S then n +1 S. Then S = N. Note. We will use mathematical induction to prove the validity of certain formulae. The proof technique will be to confirm the formula for N = 1 (step (i)) and then show that assuming the validity of the formula for N = n implies its validity for N = n + 1. You might visualize this like knocking down dominoes. If you know that (i) you have knocked down the first domino and that (ii) whenever a domino falls, it knocks down the next domino, then you can conclude that all of the dominoes fall. 2
3 Example. Prove that for all n N, we have: N (2N 1) = (2i 1) = N 2. i=1 Solution. First, for N =1, n (2i 1) = 2(1) 1=1=1 2 i=1 and the formula holds. Second, assume the formula holds for N = n: n (2i 1) = n 2. i=1 We now show that the formula holds for N = n +1: n+1 n (2i 1) = (2i 1) + (2(n +1) 1) i=1 i=1 = n 2 +(2n + 1) by the induction hpothesis = n 2 +2n +1=(n +1) 2. Hence, by the Principle of Mathematical Induction, the formula holds for all N N. N (2i 1) = N 2 i=1 3
4 Exercise In the computation of definite integrals using the definition and regular partitions, you encountered the formulae: n k = k=1 n(n +1), 2 n k 2 = k=1 n(n + 1)(2n +1), 6 n ( ) 2 n(n +1) k 3 =. 2 Use the Principle of Mathematical Induction to prove each of these. Exercise In computing the derivative of f(x) =x n, n N, by definition, you used the Binomial Theorem which states that N ( ) N (a + b) N = a N i b i i i=0 for all N N, where (N ) N! = i (N i)!i!. Use the Principle of Mathematical Induction to prove the Binomial Theorem. k=1 4
5 Note. An alternate form of the Principle of Mathematical Induction is the following: The Strong Principle of Mathematical Induction. Let S N have the properties: (i) 1 S (ii) For all n S, if{1, 2,...,n} S then n +1 S. Then S = N. Note. Going back to the domino analogy, we would say that if (i) you have knocked down the first domino and (ii) whenever the first n dominoes fall, the (n +1) st domino falls, then you can conclude that all of the dominoes fall. 5
6 TREES Note. In section 6.5 of Symbiosis 1 (Inbreeding), we introduced the idea of a graph and used a method of counting paths to define and calculate an inbreeding coefficient. In this section, we turn the application of a graph theoretic object called a tree to the study of relationships between species or other biological units. Note. Recall that a tree is an acyclic connected graph. That is, a connected graph which contains no cycle. Note. If we delete an edge from any tree, then the resulting graph consists of two disjoint pieces (i.e., two connected components). This observation, combined with the Principal of Mathematical Induction allows us to prove an important theorem concerning trees. 6
7 Theorem A tree with n vertices has n 1 edges. Proof. We prove the result holds for all n N by using induction. First, a tree with N = 1 vertex contains N 1 = 0 edges and a graph with N = 2 vertices has N 1 = 1 edge. Suppose the result holds for N = 1,N = 2,...,N = n. Consider a tree T with N = n + 1 vertices. Let (x, y) bean edge of T. If we delete edge (x, y) from T, then we get two disjoint connected graphs T 1 and T 2. Since T is an acyclic graph, then so are graphs T 1 and T 2. That is T 1 and T 2 are trees. Let N 1 be the number of vertices of T 1 and let N 2 be the number of vertices of T 2. Notice that N 1 <n+1, N 2 <n+ 1, and N 1 + N 2 = N = n + 1. So by the induction hypothesis, tree T 1 and T 2 have N 1 1 and N 2 1 edges, respectively. Now the edge set of T is the edge set of T 1 combined with the edge set of T 2 and the edge (x, y). So T has (N 1 1) + (N 2 1)+1=N 1 + N 2 1=N 1 edges. Therefore the result holds for N = n + 1 and by the Strong Principle of Mathematical Induction, the result holds for all N N. 7
8 Theorem In a tree, any two vertices are connected by a unique path. Proof. Since trees are by definition connected graphs, we know that there exists at least one path between any two vertices. We show uniqueness through proof by contradiction in which we assume that the theorem is false and derive a contradiction, leading us to conclude that the theorem is, in fact, true. So we start by assuming that there is more than one path between some two vertices. Say there are two paths between vertices u and v. Let the paths be P 1 = ue 1 v 1 e 2 v 2 e n 1 v n 1 e n v and P 2 = ue 1 v 1 e 2 v 2 e m 1 v m 1 e m v. Since the two paths are different, there is some edge e =(x, y) of P 1 that is not an edge of P 2. Now the graph P 1 P 2 e is connected (for any vertex in this graph, there is either a path to vertex u or a path to vertex v, and since P 2 is a path between u and v then there is a path between any two vertices of this graph). So in particular, there is a path in P 1 P 2 e from x to y, say path P. But then P e contans a cycle which is present in the original graph. However, since the original 8
9 graph is a tree, it cannot contain a cycle. Therefore under the assumption of the existence of two paths between some pair of vertices, we have derived a contradiction. Hence there must be only one path between any two vertices of a tree. 9
10 Note. In fact, the converse of Theorem is also true (assuming a connected graph): Theorem A connected graph with n vertices and n 1 edges is a tree. Exercise Use the Strong Principle of Mathematical Induction and Theorem to prove Theorem HINT: If T is a tree on N = n+1 vertices and you delete one vertex of T (and hence you delete all the edges incident to that vertex), then what is left? Note. Combining Theorems and 6.1.3, we get a classification of graphs which are trees: Theorem A connected graph with v vertices and e edges is a tree if and only if v = e 1. 10
11 Definition. The degree of a vertex of a graph is the number of edges incident to it. That is, the number of edges of which it is an element. Theorem The sum of the degrees of the vertices of any graph is twice the number of edges. Proof. Every edge of a graph has two vertices as elements. So if we add up the sums of the degrees of the vertices of a graph, then we count each edge twice and the sum is twice the number of edges: degree(v) = the number of edges of G. v is a vertex of G Theorem A tree on two or more vertices has at least two vertices of degree one. Proof. Let T be a tree with n vertices. Then T has n 1 edges by Theorem and the sum of the degrees of the vertices of the tree by Theorem is degree(v) =2(n 1)=2n 2. v T 11
12 If the degree of each vertex is two or more, then the sum of the degrees of the vertices is at least 2n (since there are n vertices). It follows that at least two of the vertices must be of degree one. Note. In biological applications of trees, we are particularly interested in vertices of degree one (these will often represent the biological units of interest). 12
13 HYDROCARBON MOLECULES Recall. A hydrocarbon molecule consists of only carbon and hydrogen atoms. A carbon atom has four chemical bonds and a hydrogen atom has one chemical bond. A hydrocarbon is said to be saturated if it has the maximum number of hydrogen atoms for the given number of carbon atoms (hence there are no carbon double bonds and no cycles of carbon atoms). These hydrocarbons are called alkanes. So a saturated hydrocarbon can be represented by a graph in which the carbon atoms are degree four vertices, the hydrogen atoms are degree one vertices, and the edges represent chemical bonds. Several of these ideas can be found in Bogart [2]. Example. Here are three examples of saturated hydrocarbons: 13
14 Example. In a saturated hydrocarbon with n carbon atoms, there are 2n + 2 hydrogen atoms. Proof. The hydrocarbon can be represented by a tree. Let h be the number of hydrogen atoms. Then the tree has n + h vertices and by Theorem 6.1.1, it has n + h 1 edges. We know the degree of each vertex which represents a carbon atom is four and the degree of each vertex which represents a hydrogen atom is one. So the total sum of the degrees is 4n + h. Also, by Theorem the sum of the degrees is twice the number of edges. Therefore 4n + h =2(n + h 1). From this equation, we get h =2n
15 Note. Two different saturated hydrocarbons can have the same chemical formula, but different physical structures (that is, the trees representing them can be different). Such molecules are called isomers of each other. For example, C 4 H 10 yields: Exercise Draw the trees which represent all possible saturated hydrocarbons C 5 H 12. Note. Since two carbon atoms can form a double bond, it is of interest to consider graphs which have repeated edges. Such a graph is called a multigraph (and graphs without repeated edges are often called simple graphs). 15
16 Example. Ethylene is C 2 H 4 and can be represented as: Exercise A hydrocarbon with at least one carbon double bond and no cycle is called an alkene. Show that an alkene with exactly one double carbon bond and n carbon atoms has 2n hydrogen atoms. Exercise A hydrocarbon with at least one carbon triple bond and no cycle is called an alkyne. Show that an alkyne with exactly one triple carbon bond and n carbon atoms has 2n 2 hydrogen atoms. Exercise A hydrocarbon containing one or more cycles of carbon atoms (called a carbon ring) is called a cycloalkane. Show that a saturated cycloalkane with one carbon ring and n carbon atoms has 2n hydrogen atoms. Exercise Draw a graphical representation of a benzene molecule, C 6 H 6. Is this a saturated hydrocarbon? 16
17 COUNTING TREES Note. We now consider trees which have biological applications. We are interested in representing evolutionary trees graphically. Here is an evolutionary tree and the corresponding graph: Notice that each of the vertices of degree one play a special role. Five of them represent species and one of them (labeled R) is the root of the tree. Each of the other vertices represents an episode of speciation and is hence a vertex of degree three (think of it as one species in, two species out). Since we expect speciation to occur in this bifurcating way, we restrict our study to trees with these properties. 17
18 Definition. A tree which consists of only degree one and degree three vertices is a bifurcating tree. If each of the degree one vertices is given a distinct label, then the tree is labeled. If one of the degree one vertices is declared the root, then the tree is rooted. Note. For evolutionary trees, we are primarily interested in rooted, bifurcating, labeled trees. With a nod to the botanical sciences, the degree one vertices (except for the root) are called leaves. A rooted bifurcating tree with n leaves is called an n-species tree. We wish to count the number of different n-species trees. 18
19 (2n 3)! Theorem There are rooted, bifurcating, labeled n-species trees where n 2. Each such tree has 2 n 2 (n 2)! 2n 1 edges. Note. First, for n = 2 there is exactly one such tree: and the theorem holds. Now suppose we wanted to add a third species S 3. Since the root and the species vertices must remain degree one and the internal vertices must remain degree three, the only way to add a new species is to subdivide an existing edge by introducing a new vertex and then adding a new edge incident to the new vertex with the new species as the other end of the new edge. Since the 2-species tree has three edges, this can be done in three ways: 19
20 (2(3) 3)! So there are three 3-species trees and =3. 2 (3) 2 ((3) 2)! Similarly, to add a fourth species, there are five ways to do it (since each of the 3-species trees has 5 edges) for each of the 3-species trees. Hence there are (1)(3)(5) = 15 4-species trees (2(4) 3)! and 2 (4) 2 ((4) 2)! = 15. Exercise Show algebraically that (2n 3) = (2n 3)! 2 n 2 (n 2)!. 20
21 Lemma Let T be an n-species tree. Let T 1 and T 2 be (n + 1)-species trees, each created from T by subdividing an edge and adding a new edge and a labeled vertex (say the new vertex is labeled S n+1 in both T 1 and T 2 ). Then if the edge of T which is subdivided to create T 1 is different from the edge of T used to create T 2, then T 1 and T 2 are different. Proof. Let e 1 =(u 1,v 1 ) be the edge of T which is subdivided to create T 1 and let e 2 =(u 2,v 2 ) be the edge of T which is subdivided to create T 2. Consider the path P u1 from u 1 to the root and the path P v1 from v 1 to the root. One of these paths is shorter than the other by exactly one edge (either P u1 = P v1 e 1 u 1 or P v1 = P u1 e 1 v 1 ). Without loss of generality suppose P u1 is shorter. (This illustrates the fact that a rooted tree with labeled leaves has a natural orientation: toward the root and away from the root. ) In a similar way, suppose a path from u 2 to the root is shorter than a path from v 2 to the root. Since T is a tree, there is a unique path from v 1 to v 2 and the path must include edges e 1 and e 2 (since there is a unique path from u 1 to u 2 ). Now we show that trees T 1 and T 2 are different by finding the lengths of the path between two vertices of T 1 which is different from the length of the path of the same two vertices in T 2. In T 1, a path from S n+1 to 21
22 v 1 consists only of the vertices S n+1, v, and v 1 where v is the new vertex which subdivides edge e 1. But in T 2, a path from S n+1 to v 1 must include vertices S n+1, v, u 2, and v 1 (it must also include u 1 but we do not know that u 1 and u 2 are different). So in T 2 the path from S n+1 to v 1 is longer than the path in T 1 from S n+1 to v 1. Therefore T 1 and T 2 are different. Note. The lemma shows that whenever we create an (n+1)- species tree from an n-species tree, we get different trees when we subdivide different edges. We will use induction to count the number of n-species trees. But how do we know that starting with an n-species tree and creating two (n+k)-species trees by adding k new species in different places produces different (n + k)-species trees (the lemma only guarantees a difference when k = 1)? This is where the labeling plays an 22
23 important role. If we assume the two (n + k)-species trees are the same, then we can derive a contradiction. Lemma Suppose T 1 and T 2 are two different (n + 1)- species trees generated from n-species tree T, as described in Lemma Then any (n + k)-species tree created from T 1 is different from any (n + k)-species tree created from T 2. Proof. Suppose not. Suppose T 1 is an (n + k)-species tree created from T 1 and T 2 is an (n + k)-species tree created from T 2. Then consider the (n + 1)-species trees induced by the first (n+1) labeled vertices and the root in T 1 and T 2. (These induced trees can be formed by taking the union of all of the paths from the labeled vertices to the root.) These (n + 1)- species trees are exactly T 1 and T 2. However, T 1 and T 2 are different by Lemma Since these subtrees of T 1 and T 2 are different, then T 1 and T 2 are different. 23
24 Note. This concept of same and different trees is better dealt with mathematically by introducing an isomorphism ( same shape ). An isomorphism between two graphs is a one-to-one and onto mapping between the vertex sets of the graphs which preserves the edge sets of the graphs. For example, the following two graphs are isomorphic: The isomorphism π is the function such that π(0) = a, π(1) = b, π(2) = c, π(3) = d, and π(4) = e. Of course, both graphs are a 5-cycle. Two isomorphic graphs have the same properties. If two trees are isomorphic, say, then the lengths of paths between corresponding vertices must be the same. (The correspondence is created by the mapping π.) 24
25 Lemma Any n-species tree can be generated from a 2-species tree by a unique sequence of (n 2) steps of adding new labeled vertices (species) by subdividing edges. Proof. We consider what happens by reversing the process of adding labeled vertices. Consider an n-species tree (n >2) with species as labeled vertices S 1,S 2,...,S n. Remove vertex S n and the edge containing it (since S n is degree one, there is only one edge incident to it), say edge (v,s n ). Since v is of degree three in the n-species tree, then there are two other vertices adjacent to v,sayu and v. Replace edges (u, v ) and (v,v) with edge (u, v). (This process is called pruning a tree! It has resulted in the removal of a leaf.) We then have created an (n 1)-species tree with species S 1,S 2,...,S n 1. Continue this process of pruning species until only species S 1 and S 2 are left. The reversal of the steps in this process then creates the original n-species tree from the 2-species tree. Also, by Lemma 6.1.9, there is only one sequence of steps which produces the original n-species tree from the 2-species tree. 25
26 Note. With the help of Lemmas 6.1.8, 6.1.9, and , we are now ready to count the number of n-species trees. (2n 3)! Theorem There are rooted, bifurcating, labeled n-species trees where n 2. Each such tree has 2 n 2 (n 2)! 2n 1 edges. Proof. We have already seen that these formulae hold for N = 2 and N = 3. Now suppose they hold for N = n: An (2n 3)! n-species tree has 2n 1 edges and there are 2 n 2 (n 2)! n-species trees. Consider N = n + 1. We create all (n 1)- species trees by adding a new species to an n-species tree. Since there are 2n 1 edges in an n-species tree, there are 2n 1 different ways to produce an (n + 1)-species tree from a given n-species tree. By the induction hypothesis, there are (2n 3) n-species trees, and so we can create (2n 3) (2n 1) = (2n 1)! 2 n 1 (n 1)! (2(n 1) 3)! (2N 3)! = = 2 (n+1) 2 ((n +1) 2)! 2 N 2 (N 2)! (n+1)-species trees. By Lemma the trees are all different and by Lemma we have all such trees. The n-species tree has 2n 1 edges and we have subdivided some edge into two edges and added a new edge (for a net gain of two edges). 26
27 So the (n + 1)-species tree has (2n 1)+2 = 2n 1= 2(n + 1) 1 = 2N 1 edges. Therefore by the Principle of Mathematical Induction, the theorem follows. Note. Some of the first interest in graphs concerned counting trees and was addressed by Arthur Cayley in the mid-1800s. A common approach to counting involves generating functions in which the number of objects of a given size is computed in terms of the number of objects of a given size is computed in terms of the number of objects of smaller sizes. The Fibonacci sequence f n is an elementary example of such an idea: f 1 = 1, f 2 = 1, and f n = f n 1 + f n 2 for n 3. The technique of proof presented above is due to Cavilla-Sforza and Edwards [3]. Note. The presence of the factorial in the number of n- species trees means that there is a tremendous number of such trees, even when n is fairly small. Consider the following table (from Felsenstein, page 24 [4]). 27
28 Table The number of rooted n species trees for various n. From Felsenstein [1]. # of Species n # of Trees , , ,027, ,459, We see from this table that if we want to construct a phylogenetic tree for just a few species (say 10) then it is impractical to try to search through all possible trees (for 10 species there are over 34 million trees) to find the one which best fits given data. Hence some type of algorithm is needed to help simplify the problem. This will be explored shortly. 28
29 OTHER TREES Note. Most methods of inferring phylogenies infer unrooted trees (Felsenstein page 24 [3]). That is, it is desired to find a tree which best describes evolutionary relationships, but without an idea towards a common ancestor. With much of the phylogenetic work, interest lies in extant species and the revelation of relationships based on molecular data not so much on family trees which relate extant and extinct species. Definition. An unrooted, bifurcating, labeled tree is a tree in which every vertex is of either degree three or degree one. The degree one vertices are given distinct labels. If there are n degree one vertices, the tree is called an unrooted n-species tree. Note. There is no significant difference between an unrooted n-species tree and a rooted (n 1)-species tree. We can simply think of the root of an (n 1)-species tree as the n th species. Conversely, any unrooted n-species tree can be related to an 29
30 (n 1)-species tree by declaring one of the species as the root. Since there are (2(n 1) 1)! (2(n 1) 3) = 2 (n 1) 2 ((n 1) 2)! or (2n 5)! (2n 5) = 2 n 3 (n 3)! (n 1)-species trees, then this is the number of unrooted n-species trees. Exercise Give a direct proof based on mathematical induction for the number of unrooted n-species trees. You may assume that Lemma 6.1.8, 6.1.9, and hold for unrooted trees. Note. There is one subtle conceptual difference between rooted and unrooted trees. We mentioned above the idea in a rooted tree of directions. Namely, we can think of a path that goes from a vertex towards the root or a path that goes from a vertex away from the root (and hence towards a leaf). Since unrooted trees do not have a root, these ideas are meaningless in the unrooted tree setting. 30
31 Note. An additional (and very difficult) question concerns the number of tree shapes. That is, we are interested in the number of different (nonisomorphic) unlabeled trees. The unlabeled rooted 2-species tree and 3-species trees are unique. There are two unlabeled rooted 4-trees: Exercise Give a path length argument as to why the above two graphs are different. Exercise There are three unlabeled rooted 5 species trees. What are they? There are six such 6-species trees. What are they? Note. It is not currently known how many unlabeled n- species trees there are (see Felsenstein, page 30 [3]). Several 31
32 values have been calculated and are presented in the following table. Table The number of different unlabeled rooted n species trees for various n. From Felsenstein [1]. # of Species n # of Trees ,
33 Note. We can also consider unlabeled unrooted n-species trees. There are unique examples for n {2, 3, 4, 5}: Note. Some of the numbers of unlabeled unrooted n-species trees are given in the following table. 33
34 Table The number of different unlabeled unrooted n species trees for various n. From Felsenstein [1]. # of Species n # of Trees ,
35 Exercise Find all labeled unrooted n-species trees for n {6, 7, 8}. Note. As a final comment on counting trees, we observe that the number of distinct trees on n vertices (making no assumptions of degrees or labelings) is unknown. However, the number of labeled trees on n vertices (that is, all of the vertices are labeled) is n n 2 [1]. 35
36 REFERENCES 1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, New York: North-Holland, K. P. Bogart, Introductory Combinatorics, Boston: Pitman, L. L. Cavilla-Sforza and A. W. F. Edwards, Analysis of Human Evolution, in Genetics Today, Proceedings of the XI International Congress of Genetics, The Hague, The Netherlands, September 1963, Vol. 3, ed. S. J. Geerts, Oxford: Pergamon, J. Felsenstein, Inferring Phylogenies, Sunderland, MA: Sinauer Associates,
CPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationγ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G.
MAD 3105 Spring 2006 Solutions for Review for Test 2 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 3 Solutions February 14, 2013 Introduction to Graph Theory, West Section 2.1: 37, 62 Section 2.2: 6, 7, 15 Section 2.3: 7, 10, 14 DO NOT RE-DISTRIBUTE
More informationApplied Mathematics Letters. Graph triangulations and the compatibility of unrooted phylogenetic trees
Applied Mathematics Letters 24 (2011) 719 723 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Graph triangulations and the compatibility
More informationWeek 11: Eulerian and Hamiltonian graphs; Trees. 21 and 23 November, 2018
(1/22) MA284 : Discrete Mathematics Week 11: Eulerian and amiltonian graphs; Trees http://www.maths.nuigalway.ie/ niall/ma284/ amilton s Icosian Game (Library or the Royal Irish Academy) 21 and 23 November,
More informationTrees and Tree Encodings
Trees and Tree Encodings January, 08 Introduction: Today, we are going to be looking at a special class of graph theory called trees. These structures are an important discipline in mathematics and have
More informationMath.3336: Discrete Mathematics. Chapter 10 Graph Theory
Math.3336: Discrete Mathematics Chapter 10 Graph Theory Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More informationv V Question: How many edges are there in a graph with 10 vertices each of degree 6?
ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.
More informationSolutions to In-Class Problems Week 4, Fri
Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Solutions to In-Class Problems Week 4, Fri Definition: The
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
More informationSection Summary. Introduction to Trees Rooted Trees Trees as Models Properties of Trees
Chapter 11 Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary Introduction to Trees Applications
More informationLecture 20 : Trees DRAFT
CS/Math 240: Introduction to Discrete Mathematics 4/12/2011 Lecture 20 : Trees Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed graphs. Today we continue this discussion,
More informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More informationAdjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
More informationGraph Theory Questions from Past Papers
Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory
More informationWe ve all seen trees. No, not that sprightly spruce in your garden, but your family tree. Rachael
13 Trees and Graphs 13.1 Rooted and Unrooted Trees We ve all seen trees. No, not that sprightly spruce in your garden, but your family tree. Rachael hico Arthur Serena Barbara Prasad ector Diana A tree
More informationGood Will Hunting s Problem: Counting Homeomorphically Irreducible Trees
Good Will Hunting s Problem: Counting Homeomorphically Irreducible Trees Ira M. Gessel Department of Mathematics Brandeis University Brandeis University Combinatorics Seminar September 18, 2018 Good Will
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationTrees. 3. (Minimally Connected) G is connected and deleting any of its edges gives rise to a disconnected graph.
Trees 1 Introduction Trees are very special kind of (undirected) graphs. Formally speaking, a tree is a connected graph that is acyclic. 1 This definition has some drawbacks: given a graph it is not trivial
More informationWinning Positions in Simplicial Nim
Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:
More informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationAnswers to specimen paper questions. Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes.
Answers to specimen paper questions Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes. Question 1. (a) The degree of a vertex x is the number
More informationFigure 4.1: The evolution of a rooted tree.
106 CHAPTER 4. INDUCTION, RECURSION AND RECURRENCES 4.6 Rooted Trees 4.6.1 The idea of a rooted tree We talked about how a tree diagram helps us visualize merge sort or other divide and conquer algorithms.
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many
More informationThe University of Sydney MATH2969/2069. Graph Theory Tutorial 2 (Week 9) 2008
The University of Sydney MATH99/09 Graph Theory Tutorial (Week 9) 00. Show that the graph on the left is Hamiltonian, but that the other two are not. To show that the graph is Hamiltonian, simply find
More informationK 4 C 5. Figure 4.5: Some well known family of graphs
08 CHAPTER. TOPICS IN CLASSICAL GRAPH THEORY K, K K K, K K, K K, K C C C C 6 6 P P P P P. Graph Operations Figure.: Some well known family of graphs A graph Y = (V,E ) is said to be a subgraph of a graph
More informationarxiv: v2 [math.co] 13 Aug 2013
Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed
More informationSubdivisions of Graphs: A Generalization of Paths and Cycles
Subdivisions of Graphs: A Generalization of Paths and Cycles Ch. Sobhan Babu and Ajit A. Diwan Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400076,
More information4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests
4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in
More information2. CONNECTIVITY Connectivity
2. CONNECTIVITY 70 2. Connectivity 2.1. Connectivity. Definition 2.1.1. (1) A path in a graph G = (V, E) is a sequence of vertices v 0, v 1, v 2,..., v n such that {v i 1, v i } is an edge of G for i =
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 9.3: An arithmetic progression is an increasing sequence of numbers of the form a, a+d, a+ d, a + 3d.... Van der Waerden s theorem says that no matter how we partition the natural numbers into
More informationFoundations of Computer Science Spring Mathematical Preliminaries
Foundations of Computer Science Spring 2017 Equivalence Relation, Recursive Definition, and Mathematical Induction Mathematical Preliminaries Mohammad Ashiqur Rahman Department of Computer Science College
More information1 Some Solution of Homework
Math 3116 Dr. Franz Rothe May 30, 2012 08SUM\3116_2012h1.tex Name: Use the back pages for extra space 1 Some Solution of Homework Proposition 1 (Counting labeled trees). There are n n 2 different labeled
More informationGRAPH THEORY: AN INTRODUCTION
GRAPH THEORY: AN INTRODUCTION BEGINNERS 3/4/2018 1. GRAPHS AND THEIR PROPERTIES A graph G consists of two sets: a set of vertices V, and a set of edges E. A vertex is simply a labeled point. An edge is
More informationSome Elementary Lower Bounds on the Matching Number of Bipartite Graphs
Some Elementary Lower Bounds on the Matching Number of Bipartite Graphs Ermelinda DeLaViña and Iride Gramajo Department of Computer and Mathematical Sciences University of Houston-Downtown Houston, Texas
More informationIntroductory Combinatorics
Introductory Combinatorics Third Edition KENNETH P. BOGART Dartmouth College,. " A Harcourt Science and Technology Company San Diego San Francisco New York Boston London Toronto Sydney Tokyo xm CONTENTS
More informationExtremal Graph Theory: Turán s Theorem
Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini
More informationChapter Summary. Introduction to Trees Applications of Trees Tree Traversal Spanning Trees Minimum Spanning Trees
Trees Chapter 11 Chapter Summary Introduction to Trees Applications of Trees Tree Traversal Spanning Trees Minimum Spanning Trees Introduction to Trees Section 11.1 Section Summary Introduction to Trees
More informationRecursion and Structural Induction
Recursion and Structural Induction Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Recursively Defined Functions Recursively Defined Functions Suppose we have a function with the set of non-negative
More informationUnlabeled equivalence for matroids representable over finite fields
Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,
More informationStar coloring planar graphs from small lists
Star coloring planar graphs from small lists André Kündgen Craig Timmons June 4, 2008 Abstract A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 8, 2014 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationMath 485, Graph Theory: Homework #3
Math 485, Graph Theory: Homework #3 Stephen G Simpson Due Monday, October 26, 2009 The assignment consists of Exercises 2129, 2135, 2137, 2218, 238, 2310, 2313, 2314, 2315 in the West textbook, plus the
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week Eight Problems 1. Diagrams of all the distinct non-isomorphic trees on 6 or fewer vertices are listed in the lecture notes. Extend this list by drawing all
More information2 hours THE UNIVERSITY OF MANCHESTER. 23 May :45 11:45
2 hours MAT20902 TE UNIVERSITY OF MANCESTER DISCRETE MATEMATICS 23 May 2018 9:45 11:45 Answer ALL TREE questions in Section A (30 marks in total). Answer TWO of the TREE questions in Section B (50 marks
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationDefinition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.
Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G
More informationWeek 12: Trees; Review. 22 and 24 November, 2017
(1/24) MA284 : Discrete Mathematics Week 12: Trees; Review http://www.maths.nuigalway.ie/~niall/ma284/ 22 and 24 November, 2017 C C C C 1 Trees Recall... Applications: Chemistry Applications: Decision
More informationMaximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube
Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Kavish Gandhi April 4, 2015 Abstract A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long
More informationHW Graph Theory SOLUTIONS (hbovik)
Diestel 1.3: Let G be a graph containing a cycle C, and assume that G contains a path P of length at least k between two vertices of C. Show that G contains a cycle of length at least k. If C has length
More informationMAS 341: GRAPH THEORY 2016 EXAM SOLUTIONS
MS 41: PH THEOY 2016 EXM SOLUTIONS 1. Question 1 1.1. Explain why any alkane C n H 2n+2 is a tree. How many isomers does C 6 H 14 have? Draw the structure of the carbon atoms in each isomer. marks; marks
More informationSection 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected
Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected graph G with at least 2 vertices contains at least 2
More informationExercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationMath 221 Final Exam Review
Math 221 Final Exam Review Preliminary comment: Some of these problems a formulated using language and structures from graph theory. However they are generally self contained; no theorems from graph theory
More informationMAT 145: PROBLEM SET 6
MAT 145: PROBLEM SET 6 DUE TO FRIDAY MAR 8 Abstract. This problem set corresponds to the eighth week of the Combinatorics Course in the Winter Quarter 2019. It was posted online on Friday Mar 1 and is
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite
More informationDisjoint directed cycles
Disjoint directed cycles Noga Alon Abstract It is shown that there exists a positive ɛ so that for any integer k, every directed graph with minimum outdegree at least k contains at least ɛk vertex disjoint
More informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More informationTrinets encode tree-child and level-2 phylogenetic networks
Noname manuscript No. (will be inserted by the editor) Trinets encode tree-child and level-2 phylogenetic networks Leo van Iersel Vincent Moulton the date of receipt and acceptance should be inserted later
More informationGraph Theory Mini-course
Graph Theory Mini-course Anthony Varilly PROMYS, Boston University, Boston, MA 02215 Abstract Intuitively speaking, a graph is a collection of dots and lines joining some of these dots. Many problems in
More informationMath 443/543 Graph Theory Notes
Math 443/543 Graph Theory Notes David Glickenstein September 3, 2008 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.
More informationMidterm 2 Solutions. CS70 Discrete Mathematics and Probability Theory, Spring 2009
CS70 Discrete Mathematics and Probability Theory, Spring 2009 Midterm 2 Solutions Note: These solutions are not necessarily model answers. Rather, they are designed to be tutorial in nature, and sometimes
More informationIndependence Number and Cut-Vertices
Independence Number and Cut-Vertices Ryan Pepper University of Houston Downtown, Houston, Texas 7700 pepperr@uhd.edu Abstract We show that for any connected graph G, α(g) C(G) +1, where α(g) is the independence
More informationNotes 4 : Approximating Maximum Parsimony
Notes 4 : Approximating Maximum Parsimony MATH 833 - Fall 2012 Lecturer: Sebastien Roch References: [SS03, Chapters 2, 5], [DPV06, Chapters 5, 9] 1 Coping with NP-completeness Local search heuristics.
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationMath236 Discrete Maths with Applications
Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 19 Degree Sequences Let G be a graph with vertex set V (G) = {v 1, v 2, v
More informationEDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m
EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m GARY MACGILLIVRAY BEN TREMBLAY Abstract. We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation
More informationOn Universal Cycles of Labeled Graphs
On Universal Cycles of Labeled Graphs Greg Brockman Harvard University Cambridge, MA 02138 United States brockman@hcs.harvard.edu Bill Kay University of South Carolina Columbia, SC 29208 United States
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationMAT 3271: Selected Solutions to the Assignment 6
Chapter 2: Major Exercises MAT 3271: Selected Solutions to the Assignment 6 1. Since a projective plan is a model of incidence geometry, Incidence Axioms 1-3 and Propositions 2.1-2.5 (which follow logically
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More information5 Matchings in Bipartite Graphs and Their Applications
5 Matchings in Bipartite Graphs and Their Applications 5.1 Matchings Definition 5.1 A matching M in a graph G is a set of edges of G, none of which is a loop, such that no two edges in M have a common
More informationGraph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011
Graph Theory Martin Stynes Department of Mathematics, UCC email: m.stynes@ucc.ie January 26, 2011 1 Introduction to Graphs 1 A graph G = (V, E) is a non-empty set of nodes or vertices V and a (possibly
More informationEvolution of Tandemly Repeated Sequences
University of Canterbury Department of Mathematics and Statistics Evolution of Tandemly Repeated Sequences A thesis submitted in partial fulfilment of the requirements of the Degree for Master of Science
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 4 Graphs Definitions Traversals Adam Smith 9/8/10 Exercise How can you simulate an array with two unbounded stacks and a small amount of memory? (Hint: think of a
More informationMATH10001 Mathematical Workshop. Graphs, Trees and Algorithms Part 2. Trees. From Trees to Prüfer Codes
MATH10001 Mathematical Workshop Graphs, Trees and Algorithms Part 2 Trees Recall that a simple graph is one without loops or multiple edges. We are interested in a special type of simple graph: A tree
More informationEnumerating Perfect Matchings in a Ring of Diamonds
Enumerating Perfect Matchings in a Ring of Diamonds Shiena P. Tejada and Rhudaina Z. Mohammad College of Science of Mathematics Western Mindanao State University Abstract This paper presents an algorithm
More informationK 4,4 e Has No Finite Planar Cover
K 4,4 e Has No Finite Planar Cover Petr Hliněný Dept. of Applied Mathematics, Charles University, Malostr. nám. 25, 118 00 Praha 1, Czech republic (E-mail: hlineny@kam.ms.mff.cuni.cz) February 9, 2005
More informationFOUR EDGE-INDEPENDENT SPANNING TREES 1
FOUR EDGE-INDEPENDENT SPANNING TREES 1 Alexander Hoyer and Robin Thomas School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT We prove an ear-decomposition theorem
More informationTwo Characterizations of Hypercubes
Two Characterizations of Hypercubes Juhani Nieminen, Matti Peltola and Pasi Ruotsalainen Department of Mathematics, University of Oulu University of Oulu, Faculty of Technology, Mathematics Division, P.O.
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More informationCS 441 Discrete Mathematics for CS Lecture 26. Graphs. CS 441 Discrete mathematics for CS. Final exam
CS 441 Discrete Mathematics for CS Lecture 26 Graphs Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Final exam Saturday, April 26, 2014 at 10:00-11:50am The same classroom as lectures The exam
More informationSolution to Graded Problem Set 4
Graph Theory Applications EPFL, Spring 2014 Solution to Graded Problem Set 4 Date: 13.03.2014 Due by 18:00 20.03.2014 Problem 1. Let V be the set of vertices, x be the number of leaves in the tree and
More informationCMSC th Lecture: Graph Theory: Trees.
CMSC 27100 26th Lecture: Graph Theory: Trees. Lecturer: Janos Simon December 2, 2018 1 Trees Definition 1. A tree is an acyclic connected graph. Trees have many nice properties. Theorem 2. The following
More informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More informationCS 311 Discrete Math for Computer Science Dr. William C. Bulko. Graphs
CS 311 Discrete Math for Computer Science Dr. William C. Bulko Graphs 2014 Definitions Definition: A graph G = (V,E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge
More informationLecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) January 11, 2018 Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 In this lecture
More informationBIL694-Lecture 1: Introduction to Graphs
BIL694-Lecture 1: Introduction to Graphs Lecturer: Lale Özkahya Resources for the presentation: http://www.math.ucsd.edu/ gptesler/184a/calendar.html http://www.inf.ed.ac.uk/teaching/courses/dmmr/ Outline
More informationMatching Theory. Figure 1: Is this graph bipartite?
Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to
More informationON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT
ON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT A graph G is self complementary if it is isomorphic to its complement G.
More informationThroughout the chapter, we will assume that the reader is familiar with the basics of phylogenetic trees.
Chapter 7 SUPERTREE ALGORITHMS FOR NESTED TAXA Philip Daniel and Charles Semple Abstract: Keywords: Most supertree algorithms combine collections of rooted phylogenetic trees with overlapping leaf sets
More information