Publication:3875972

Related Items

The maximum matching energy of bicyclic graphs with even girth, Matching polynomials: A matrix approach and its applications, Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth, On some counting polynomials in chemistry, The minimum matching energy of bicyclic graphs with given girth, On matching integral graphs, Matching Energy of Graphs with Maximum Degree at Most 3, Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts, Matchings in graphs with a given number of cuts, The matching energy of graphs with given edge connectivity, Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees, Extremal bipartite graphs of given connectivity with respect to matching energy, A fast numerical method for fractional partial integro-differential equations with spatial-time delays, 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, 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, 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, Lower bounds on matching energy of graphs, 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