The following pages link to On matching coefficients (Q1176747):
Displaying 18 items.
- Closed formulas for the number of small paths, independent sets and matchings in fullerenes (Q712590) (← links)
- The graph polynomial and the number of proper vertex colorings (Q1296159) (← links)
- The matching polynomial of a regular graph (Q1343771) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees (Q1408460) (← links)
- Remarks on characteristic coefficients of fullerene graphs (Q1644081) (← links)
- On the characterizing properties of the permanental polynomials of graphs (Q1932591) (← links)
- Per-spectral characterizations of some bipartite graphs (Q2409785) (← links)
- Counting Matchings and Tree-Like Walks in Regular Graphs (Q3058300) (← links)
- Computing the Number of Matchings in Catacondensed Benzenoid Systems (Q5050761) (← links)
- On the Number of All Substructures Containing at Most Four Edges (Q5050770) (← links)
- Laplacian coefficients and Zagreb indices of trees (Q5227938) (← links)
- Characterizing properties of permanental polynomials of lollipop graphs (Q5495730) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- Relationship between Laplacian and signless Laplacian coefficients of polythiophene (Q6101418) (← links)
- On the number of \(k\)-matchings in graphs (Q6103532) (← links)
- On the divisibility of H-shape trees and their spectral determination (Q6168559) (← links)
- On the distribution of non-attacking bishops on a chessboard \(C\) (Q6597123) (← links)
