An identity involving 3-regular graphs

DOI10.1016/0012-365X(94)00274-MMaRDI QIDQ1917501zbMATH OpenFDO

Authors Douglas R. Woodall

Publication date 7 July 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(94)00274-M

zbMATH Keywords

3-regular graphs\(M\)-cover\(M\)-partitionsperfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

The author shows that if \(M\) is a perfect matching in a 3-regular graph \(G\), then the number of positive-minus-negative \(M\)-covers of \(G\) is equal to the number of positive-minus-negative \(M\)-partitions of \(G\). Also, either there are no \(M\)-partitions of \(G\), or every \(M\)-partition and every \(M\)-cover has the same sign.

Recommendations

• Perfect matchings of regular bipartite graphs
• On perfect matchings in matching covered graphs
• The number of perfect matchings in two types of 3-regular graphs
• Matchings in regular graphs: minimizing the partition function

Cites work

• A short algorithm to delete singular junctions in bond graphs
• Bond graphs. II: Causality and singularity

Cited in

(4)

• Properties of the corolla polynomial of a 3-regular graph
• scientific article; zbMATH DE number 9844 (Why is no real title available?)
• Bond graphs. II: Causality and singularity
• An \(S_ 3(3,5,21)\) using graphs

This page was built for publication: An identity involving 3-regular graphs

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