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. |
---|---|
格式: | text |
語言: | English |
出版: |
Animo Repository
1997
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/16439 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Some universal graphs
由: Bautista, Paolo Lorenzo Y., et al.
出版: (2009) -
Notions of domination for some classses of graphs
由: Castaneda, Adrian Timothy S., et al.
出版: (2015) -
Fold thickness of some graphs
由: Campeña, Francis Joseph H., et al.
出版: (2009) -
An application of graph theory in block planning
由: Caneda, Maria Rennelyn G., et al.
出版: (2008) -
On the energy of some special classes of graphs
由: Angala, Bianca Marie P., et al.
出版: (2010)