On the number of perfect matchings of line graphs

DOI10.1016/J.DAM.2012.10.032zbMATH Open1262.05123OpenAlexW4318612841MaRDI QIDQ1946221FDOQ1946221

F. M. Dong, Fuji Zhang, Weigen Yan

Publication date: 18 April 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.032

zbMATH Keywords

line graphperfect matchingcyclomatic number

Mathematics Subject Classification ID

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

Cited In (11)

• On the dimer problem of the vertex-edge graph of a cubic graph
• Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
• Asymptotic behavior of a generalized independent sets model on the two-dimensional Sierpinski gasket
• On the number of perfect matchings in the line graph of a traceable graph
• Touching perfect matchings and halving lines
• Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings
• On perfect linegraph squares
• Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\)
• A new lower bound for the number of perfect matchings of line graph
• Some physical and chemical indices of clique-inserted lattices
• Maximum matchings in scale-free networks with identical degree distribution

This page was built for publication: On the number of perfect matchings of line graphs

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