Sharp bounds for the number of matchings in generalized-theta-graphs

DOI10.7151/DMGT.1646zbMath1291.05093OpenAlexW2005198844MaRDI QIDQ2866420

Ardeshir Dolati

Publication date: 13 December 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1646

zbMATH Keywords

matchingFibonacci numberHosoya indexgeneralized-theta-graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

This page was built for publication: Sharp bounds for the number of matchings in generalized-theta-graphs