Sharp Lower Bound for the Total Number of Matchings of Tricyclic Graphs

Shuchao Li, Zhongxun Zhu

Abstract


Let $\mathscr{T}_n$ be the class of tricyclic graphs on $n$ vertices. In this paper, a sharp lower bound for the total number of matchings of graphs in $\mathscr{T}_n$ is determined.


Full Text: PDF