The tight upper bound for the number of matchings of tricyclic graphs (Q426849)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The tight upper bound for the number of matchings of tricyclic graphs |
scientific article; zbMATH DE number 6045693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The tight upper bound for the number of matchings of tricyclic graphs |
scientific article; zbMATH DE number 6045693 |
Statements
The tight upper bound for the number of matchings of tricyclic graphs (English)
0 references
12 June 2012
0 references
Summary: In this paper, we determine the tight upper bound for the number of matchings of connected \(n\)-vertex tricyclic graphs. We show that this bound is \(13f_{n-4}+16f_{n-5},\) where \(f_{n}\) be the \(n\)th Fibonacci number. We also characterize the \(n\)-vertex simple connected tricyclic graph for which the bound is best possible.
0 references
matching
0 references
Fibonacci number
0 references
Hosoya index
0 references
tricyclic graph
0 references
connected graph
0 references
