On matching coefficients

DOI10.1016/0012-365X(91)90369-DMaRDI QIDQ1176747zbMATH OpenFDO

Authors S. Singh, E. J. Farrell, J. M. Guo, Gregory M. Constantine

Publication date 25 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(91)90369-D

zbMATH Keywords

matching coefficientsmatching polynomialregular multipartite graphstriangles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Counting matchings in graphs
• scientific article; zbMATH DE number 5656434
• scientific article; zbMATH DE number 951843
• On coefficients of circuit polynomials and characteristic polynomials
• scientific article; zbMATH DE number 2188337

Cites work

• An introduction to matching polynomials
• scientific article; zbMATH DE number 1052837 (Why is no real title available?)
• Matchings in benzene chains

Cited in

(26)

• On coefficients of circuit polynomials and characteristic polynomials
• The graph polynomial and the number of proper vertex colorings
• The matching polynomial of a regular graph
• A bibliography on chromatic polynomials
• Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
• Matching coefficients for improved staggered bilinears
• Remarks on characteristic coefficients of fullerene graphs
• On the characterizing properties of the permanental polynomials of graphs
• The matching polynomial of a distance-regular graph
• Per-spectral characterizations of some bipartite graphs
• Counting matchings and tree-like walks in regular graphs
• On Linking Coefficients
• A note on the matching numbers of triangle-free graphs
• scientific article; zbMATH DE number 951843 (Why is no real title available?)
• Computing the number of matchings in catacondensed benzenoid systems
• On the number of all substructures containing at most four edges
• Laplacian coefficients and Zagreb indices of trees
• Characterizing properties of permanental polynomials of lollipop graphs
• On Weisfeiler-Leman invariance: subgraph counts and related graph properties
• Relationship between Laplacian and signless Laplacian coefficients of polythiophene
• On the number of k-matchings in graphs
• On the divisibility of H-shape trees and their spectral determination
• Permanents of almost regular complete bipartite graphs
• On the distribution of non-attacking bishops on a chessboard \(C\)
• Spectral determination of trees with large diameter and small spectral radius
• Closed formulas for the number of small paths, independent sets and matchings in fullerenes

This page was built for publication: On matching coefficients

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