scientific article; zbMATH DE number 3679880

Cited in

(33)

Matching polynomials: A matrix approach and its applications
On some counting polynomials in chemistry
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
Extremal bipartite graphs of given connectivity with respect to matching energy
Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts
Lower bounds on matching energy of graphs
On matching integral graphs
Matchings in graphs with a given number of cuts
A fast numerical method for fractional partial integro-differential equations with spatial-time delays
Extremal graphs with respect to matching energy for random six-membered ring spiro chains
Extremal matching energy and the largest matching root of complete multipartite graphs
The matching energy of random graphs
The maximum matching energy of bicyclic graphs with even girth
The minimum matching energy of bicyclic graphs with given girth
Graphs with integer matching polynomial zeros
Further results on monotonic graph invariants and bipartiteness number
A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types
Matching Energy of Graphs with Maximum Degree at Most 3
The matching polynomial of the path-tree of a complete graph
Matchings in bipartite graphs with a given number of cuts
The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
Extremal values of matching energies of one class of graphs
The extremal values of some topological indices in bipartite graphs with a given matching number
Coefficients of the matching polynomial of a self-complementary graph
Matching integral graphs with maximum vertex degree four
Matching polynomials of path-trees of a complete bipartite graph
Bipartite cacti with extremal matching energy
Closed formulas for the number of small paths, independent sets and matchings in fullerenes
The matching energy of a graph
Extremal matching energy of complements of trees
The matching energy of graphs with given parameters
The matching energy of graphs with given edge connectivity

This page was built for publication:

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