𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The smallest Hosoya index in (n,n+ 1)-graphs

✍ Scribed by Hanyuan Deng


Book ID
106419372
Publisher
Springer
Year
2007
Tongue
English
Weight
260 KB
Volume
43
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Regular factors in K1,n free graphs
✍ Yoshimi Egawa; Katsuhiro Ota πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 280 KB

## Abstract A graph is said to be __K__~1,__n__~‐free, if it contains no __K__~1,__n__~ as an induced subgraph. We prove that for __n__ β©Ύ 3 and __r__ β©Ύ __n__ βˆ’1, if __G__ is a __K__~1,__n__~‐free graph with minimum degree at least (__n__^2^/4(__n__ βˆ’1))__r__ + (3__n__ βˆ’6)/2 + (__n__ βˆ’1)/4__r__, the