Some applications of mathematical induction to graph theory

• Main Authors: Cordova, Wilson, Young, Sharon G.
• Format: text
• Language: English
• Published: Animo Repository 1997
• Subjects: Graph theory; Induction (Mathematics); Automatic hypothesis formation
• Online Access: https://animorepository.dlsu.edu.ph/etd_bachelors/16439
• Institution: De La Salle University

The principle of mathematical induction is stated as follows: Let T be a set of positive integers with the properties: 1.) 1 is in S, and b.) Whenever the integer k is in S then the next integer k+1 must also be in S. Then S is the set of all positive integers. Mathematical induction is a method for proving that something will keep on being true given that it is true in one case, and being true for one case leads it to be true for the next. This study provides proofs of some theorems in Graph Theory by using mathematical induction as a tool.