Sharp bounds for the number of matchings in generalized-theta-graphs
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 4, pp. 771-782
Voir la notice de l'article provenant de la source Library of Science
A generalized-theta-graph is a graph consisting of a pair of end vertices joined by k (k ≥ 3) internally disjoint paths. We denote the family of all the n-vertex generalized-theta-graphs with k paths between end vertices by Θⁿₖ. In this paper, we determine the sharp lower bound and the sharp upper bound for the total number of matchings of generalized-theta-graphs in Θⁿₖ. In addition, we characterize the graphs in this class of graphs with respect to the mentioned bounds.
Keywords:
generalized-theta-graph, matching, Fibonacci number, Hosoya index
@article{DMGT_2012_32_4_a11,
author = {Dolati, Ardeshir and Golalizadeh, Somayyeh},
title = {Sharp bounds for the number of matchings in generalized-theta-graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {771--782},
publisher = {mathdoc},
volume = {32},
number = {4},
year = {2012},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_4_a11/}
}
TY - JOUR AU - Dolati, Ardeshir AU - Golalizadeh, Somayyeh TI - Sharp bounds for the number of matchings in generalized-theta-graphs JO - Discussiones Mathematicae. Graph Theory PY - 2012 SP - 771 EP - 782 VL - 32 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2012_32_4_a11/ LA - en ID - DMGT_2012_32_4_a11 ER -
%0 Journal Article %A Dolati, Ardeshir %A Golalizadeh, Somayyeh %T Sharp bounds for the number of matchings in generalized-theta-graphs %J Discussiones Mathematicae. Graph Theory %D 2012 %P 771-782 %V 32 %N 4 %I mathdoc %U http://geodesic.mathdoc.fr/item/DMGT_2012_32_4_a11/ %G en %F DMGT_2012_32_4_a11
Dolati, Ardeshir; Golalizadeh, Somayyeh. Sharp bounds for the number of matchings in generalized-theta-graphs. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 4, pp. 771-782. http://geodesic.mathdoc.fr/item/DMGT_2012_32_4_a11/