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

  • Shuchao Li
  • Zhongxun Zhu
DOI: https://doi.org/10.37236/404

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.

Published
2010-10-05
How to Cite
Li, S., & Zhu, Z. (2010). Sharp Lower Bound for the Total Number of Matchings of Tricyclic Graphs. The Electronic Journal of Combinatorics, 17(1), R132. https://doi.org/10.37236/404
Issue
Volume 17 (2010)
Article Number
R132