Sharp lower bound for the total number of matchings of tricyclic graphs (Q1960286)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5799460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sharp lower bound for the total number of matchings of tricyclic graphs |
scientific article; zbMATH DE number 5799460 |
Statements
Sharp lower bound for the total number of matchings of tricyclic graphs (English)
0 references
13 October 2010
0 references
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.
0 references
tricyclic graphs
0 references
total number of matchings
0 references
0.8830744028091431
0 references
0.8023691177368164
0 references
0.7999240159988403
0 references
0.7804908752441406
0 references
0.7785640358924866
0 references
