The Maximum Number of Spanning Trees of a Graph with Given Matching Number

The number of spanning trees of a graph G is the total number of distinct spanning subgraphs of G that are trees. Feng et al. determined the maximum number of spanning trees in the class of connected graphs with n vertices and matching number β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document} for 2≤β≤n/3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2\le \beta \le n/3$$\end{document} and β=⌊n/2⌋\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta =\lfloor n/2\rfloor $$\end{document}. They also pointed out that it is still an open problem to the case of n/3<β≤⌊n/2⌋-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n/3<\beta \le \lfloor n/2\rfloor -1$$\end{document}. In this paper, we solve this problem completely.