The number of spanning trees of a graph with given matching number

Lihua Feng,Kexiang Xu,Kinkar Chandra Das,Aleksandar Ilić,Guihai Yu

The number of spanning trees of a graph with given matching number

2016

Lihua Feng
Kexiang Xu
Kinkar Chandra Das
Aleksandar Ilić
Guihai Yu

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.

Keywords:

Combinatorics
Trémaux tree
Wagner graph
Geometric graph theory
Discrete mathematics
Factor-critical graph
Reverse-delete algorithm
Minimum degree spanning tree
Graph factorization
Mathematics
Spanning tree
Tree (graph theory)
Arboricity
Minimum spanning tree

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations