Name
Abstract | ||
|---|---|---|
The number of spanning trees of a graph G is the total number of distinct spanning subgraphs of G that are trees. In this paper, we present sharp upper bounds for the number of spanning trees of a graph with given matching number. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1080/00207160.2015.1021341 | International Journal of Computer Mathematics |
Keywords | Field | DocType |
matrix,spanning tree,graph | Discrete mathematics,Combinatorics,Trémaux tree,Tree (graph theory),Minimum degree spanning tree,Graph factorization,Spanning tree,Arboricity,Mathematics,Reverse-delete algorithm,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
93 | 6 | 0020-7160 |
Citations | PageRank | References |
4 | 0.58 | 11 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lihua Feng | 1 | 61 | 14.50 |
| Kexiang Xu | 2 | 72 | 11.43 |
| Kinkar Ch. Das | 3 | 208 | 30.32 |
| Aleksandar Ilic | 4 | 283 | 35.40 |
| Guihai Yu | 5 | 47 | 10.22 |