The matching equivalent classes of graphs of K₁ I_n

zbMATH Open1108.05078MaRDI QIDQ5483741FDOQ5483741

Authors: Haicheng Ma 

Publication date: 23 August 2006

Recommendations

• scientific article; zbMATH DE number 7366336
• scientific article; zbMATH DE number 1279034
• The matching equivalent graphs of \(P_m\cup Q (3, n)\)
• Matching equivalencies of bipartite graphs
• A class of `matching-equivalent' bipartite graphs

zbMATH Keywords

matching polynomialmatching equivalent

Mathematics Subject Classification ID

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

Cited In (5)

• The matching equivalence classes of graphs with the maximum matching root less than or equal to 2
• The matching equivalent graphs of \(P_m\cup Q (3, n)\)
• Uniqueness of the matching polynomial
• Title not available (Why is that?)
• Equivalence classes in matching covered graphs

This page was built for publication: The matching equivalent classes of graphs of \(K_1\cup I_n\)

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