scientific article

From MaRDI portal
Revision as of 18:49, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3875972

zbMath0436.05053MaRDI QIDQ3875972

Ivan Gutman

Publication date: 1979


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (27)

The maximum matching energy of bicyclic graphs with even girthMatching polynomials: A matrix approach and its applicationsCorrigendum to: ``The minimum matching energy of bicyclic graphs with given girthOn some counting polynomials in chemistryThe minimum matching energy of bicyclic graphs with given girthOn matching integral graphsMatching Energy of Graphs with Maximum Degree at Most 3Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall countsMatchings in graphs with a given number of cutsThe matching energy of graphs with given edge connectivityClosed formulas for the numbers of small independent sets and matchings and an extremal problem for treesExtremal bipartite graphs of given connectivity with respect to matching energyA fast numerical method for fractional partial integro-differential equations with spatial-time delaysThe bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energiesExtremal values of matching energies of one class of graphsThe extremal values of some topological indices in bipartite graphs with a given matching numberGraphs with integer matching polynomial zerosFurther results on monotonic graph invariants and bipartiteness numberA novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative typesClosed formulas for the number of small paths, independent sets and matchings in fullerenesThe matching energy of a graphExtremal matching energy of complements of treesThe matching energy of graphs with given parametersLower bounds on matching energy of graphsExtremal graphs with respect to matching energy for random six-membered ring spiro chainsExtremal matching energy and the largest matching root of complete multipartite graphsThe matching energy of random graphs




This page was built for publication: