Sharp lower bound for the total number of matchings of tricyclic graphs
type: Item
instance of: scholarly article
title: Sharp lower bound for the total number of matchings of tricyclic graphs
zbMATH Open document ID: 1264.05105
author: Shuchao Li
author: Zhongxun Zhu
published in: The Electronic Journal of Combinatorics
publication date: 2010-10-13T00:00:00Z
full work available at URL: v17i1r132.html
review text: 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.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5799460
zbMATH Keywords: tricyclic graphs
zbMATH Keywords: total number of matchings
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5799460