Title

Some applications of mathematical induction to graph theory

Date of Publication

1997

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics Department

Abstract/Summary

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.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU08299

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Physical Description

42 leaves

Keywords

Graph theory; Induction (Mathematics); Automatic hypothesis formation

This document is currently not available here.

Share

COinS