The matching polynomial of a regular graph

DOI10.1016/0012-365X(93)E0125-NzbMath0813.05049MaRDI QIDQ1343771

Robert A. Beezer, E. J. Farrell

Publication date: 6 February 1995

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

zbMATH Keywords

regular graphmatching polynomial

Mathematics Subject Classification ID

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

Related Items (11)

Graphs determined by polynomial invariants ⋮ On a conjecture of Wilf ⋮ The new methods for constructing matching-equivalence graphs ⋮ Graphs with few matching roots ⋮ On sequences of polynomials arising from graph invariants ⋮ Unnamed Item ⋮ Local WL invariance and hidden shades of regularity ⋮ Counting configurations in designs ⋮ Counting Matchings and Tree-Like Walks in Regular Graphs ⋮ Graphs with six distinct matching roots ⋮ Matching polynomials for some nanostar dendrimers

Cites Work

• Unnamed Item
• On matching coefficients
• Connections between the matching and chromatic polynomials
• On a general class of graph polynomials
• An introduction to matching polynomials
• Cages—a survey
• A new 5‐arc‐transitive cubic graph

This page was built for publication: The matching polynomial of a regular graph