A new lower bound for the number of perfect matchings of line graph

DOI10.1016/J.IPL.2014.09.026zbMATH Open1304.05114OpenAlexW2023916160MaRDI QIDQ477656FDOQ477656

Authors: Xue Zhou 

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.026

Recommendations

• Graphs with second smallest number of perfect matchings of line graphs.
• On the number of perfect matchings in the line graph of a traceable graph
• On the number of perfect matchings of line graphs
• A new lower bound on the number of perfect matchings in cubic graphs
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues

zbMATH Keywords

enumerationline graphperfect matchingcombinatorial problems2-connected graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Graph theory
• Matching theory
• Enumeration of perfect matchings in graphs with reflective symmetry
• Dimers and amoebae
• The Complexity of Enumeration and Reliability Problems
• Even circuits of prescribed clockwise parity
• Graphs with 1-Factors
• On the number of perfect matchings of line graphs

Cited In (5)

• Graphs with second smallest number of perfect matchings of line graphs.
• On the number of perfect matchings in the line graph of a traceable graph
• Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\)
• On perfect matchings of complements of line graphs
• On the number of perfect matchings of line graphs

This page was built for publication: A new lower bound for the number of perfect matchings of line graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477656)