|
|||||
|
|
The number of spanning trees of a graph with given matching number |
|
| Authors: | Lihua Feng Kinkar Ch Das Aleksandar Ilić Guihai Yu |
| Affiliation: | 1. School of Mathematics and Statistics, Central South University, Changsha, Hunan, China;2. Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea;3. Faculty of Sciences and Mathematics, University of Ni?, Vi?egradska 33, 18000 Ni?, Serbia;4. School of Mathematics, Shandong Institute of Business &5. Technology, Yantai, Shandong, China |
| 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. |
| Keywords: | graph matrix Laplacian spectrum spanning tree matching number |