𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tree graphs and tree numbers

✍ Scribed by Krishnamoorthy, M.; Deo, N.


Book ID
117913589
Publisher
IEEE
Year
1975
Weight
390 KB
Volume
22
Category
Article
ISSN
0098-4094

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Rank numbers for some trees and unicycli
✍ Emily Sergel; Peter Richter; Anh Tran; Patrick Curran; Jobby Jacob; Darren A. Na πŸ“‚ Article πŸ“… 2011 πŸ› Springer 🌐 English βš– 272 KB
Extremal theory and bipartite graph-tree
✍ P. Erd'́os; R.J. Faudree; C.C. Rousseau; R.H. Schelp πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 675 KB

For a positive integer n and graph E, fs(n) is the least integer m such that any graph of order n and minimal degree m has a copy of B. It will be show that if B is a bipartite graph with parts of order k and 1 (k G I), then there exists a positive constant c, such that for any tree T,, of order II