- Tytuł:
- Sharp bounds for the number of matchings in generalized-theta-graphs
- Autorzy:
-
Dolati, Ardeshir
Golalizadeh, Somayyeh - Powiązania:
- https://bibliotekanauki.pl/articles/743313.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
generalized-theta-graph
matching
Fibonacci number
Hosoya index - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 4; 771-782
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł