On matching coefficients
From MaRDI portal
Publication:1176747
DOI10.1016/0012-365X(91)90369-DzbMath0764.05074MaRDI QIDQ1176747
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (17)
Computing the Number of Matchings in Catacondensed Benzenoid Systems ⋮ On the Number of All Substructures Containing at Most Four Edges ⋮ The matching polynomial of a regular graph ⋮ Remarks on characteristic coefficients of fullerene graphs ⋮ A bibliography on chromatic polynomials ⋮ Per-spectral characterizations of some bipartite graphs ⋮ On the characterizing properties of the permanental polynomials of graphs ⋮ 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 ⋮ Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees ⋮ Closed formulas for the number of small paths, independent sets and matchings in fullerenes ⋮ Counting Matchings and Tree-Like Walks in Regular Graphs ⋮ On Weisfeiler-Leman invariance: subgraph counts and related graph properties ⋮ Laplacian coefficients and Zagreb indices of trees ⋮ Characterizing properties of permanental polynomials of lollipop graphs
Cites Work
This page was built for publication: On matching coefficients
