Geodesic
The tight upper bound for the number of matchings of tricyclic graphs
Ardeshir Dolati1 ; Somayyeh Golalizadeh2
1Shahed University
2Islamic Azad University
The electronic journal of combinatorics, Tome 19 (2012) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 $13 f_{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.A corrigendum was added to this paper on Jun 17, 2015.
DOI : 10.37236/2165
Classification : 05C70, 05C90
Mots-clés : matching, Fibonacci number, Hosoya index, tricyclic graph, connected graph

Ardeshir Dolati  1   ; Somayyeh Golalizadeh  2

1 Shahed University
2 Islamic Azad University 
@article{10_37236_2165,
     author = {Ardeshir Dolati and Somayyeh Golalizadeh},
     title = {The tight upper bound for the number of matchings of tricyclic graphs},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {1},
     doi = {10.37236/2165},
     zbl = {1243.05194},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2165/}
}
TY  - JOUR
AU  - Ardeshir Dolati
AU  - Somayyeh Golalizadeh
TI  - The tight upper bound for the number of matchings of tricyclic graphs
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2165/
DO  - 10.37236/2165
ID  - 10_37236_2165
ER  - 
%0 Journal Article
%A Ardeshir Dolati
%A Somayyeh Golalizadeh
%T The tight upper bound for the number of matchings of tricyclic graphs
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2165/
%R 10.37236/2165
%F 10_37236_2165
Ardeshir Dolati; Somayyeh Golalizadeh. The tight upper bound for the number of matchings of tricyclic graphs. The electronic journal of combinatorics, Tome 19 (2012) no. 1. doi: 10.37236/2165

Cité par Sources :