On the upper bounds of the numbers of perfect matchings in graphs with given parameters

DOI10.1007/s10255-006-0360-1zbMath1111.05050OpenAlexW2017040432MaRDI QIDQ871682

Hong Lin, Xiaofeng Guo

Publication date: 20 March 2007

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-0360-1

zbMATH Keywords

extremal graphsdiameterindependence numberconnectivitychromatic numberclique number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

The matching energy of graphs with given parameters

Cites Work

• Diameters in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the upper bounds of the numbers of perfect matchings in graphs with given parameters