A note on the pure Morse complex of a graph
✍ Scribed by R. Ayala; L.M. Fernández; A. Quintero; J.A. Vilches
- Book ID
- 108286420
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 220 KB
- Volume
- 155
- Category
- Article
- ISSN
- 0166-8641
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Three results on the interval number of a graph on n vertices are presented. (1) The interval number of almost every graph is between n/4 Ig n and n/4 (this also holds for almost every bipartite graph). ( 2) There exist K+\_,, -free bipartite graphs with interval number at least c(m)n 1-2'Cm+1J/lg
The number of spanning trees in a finite graph is first expressed as the derivative (at 1) of a determinant and then in terms of a zeta function. This generalizes a result of Hashimoto to non-regular graphs. ## 1998 Academic Press Let G be a finite graph. The complexity of G, denoted }, is the num