Sharp lower bound for the total number of matchings of tricyclic graphs
Summary: Let \(\mathcal 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 \(\mathcal T_n\) is determined.
scientific article; zbMATH DE number 5799460