go-v.orgdoi

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

Shuchao Li, Zhongxun Zhu · The Electronic Journal of Combinatorics · 2010

  • DOI 10.37236/404
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2010

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2010

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.

Open the resolved locator · 10.37236/404

Metadata licence: OpenAlex metadata (CC0)