Cargando…
On the Number of Spanning Trees of Graphs
We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Δ(1)), minimum vertex degree (δ), first Zagreb index (M (1)), and Randić index (R (−1)).
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Hindawi Publishing Corporation
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3962762/ https://www.ncbi.nlm.nih.gov/pubmed/24688378 http://dx.doi.org/10.1155/2014/294038 |