Some applications of mathematical induction to graph theory
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...
Saved in:
Main Authors: | Cordova, Wilson, Young, Sharon G. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1997
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16439 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Some universal graphs
by: Bautista, Paolo Lorenzo Y., et al.
Published: (2009) -
Notions of domination for some classses of graphs
by: Castaneda, Adrian Timothy S., et al.
Published: (2015) -
Fold thickness of some graphs
by: Campeña, Francis Joseph H., et al.
Published: (2009) -
On the energy of some special classes of graphs
by: Angala, Bianca Marie P., et al.
Published: (2010) -
On total and entire weightings of plane graphs and some special classes of graphs
by: Ilagan, Mark Francis M., et al.
Published: (2016)