The matching energy of graphs with given parameters

DOI10.1016/j.dam.2013.09.014zbMath1300.05162OpenAlexW1990362489MaRDI QIDQ741776

Weigen Yan, Shuli Li

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.014

zbMATH Keywords

connectivitychromatic numbermatching energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (19)

The maximum matching energy of bicyclic graphs with even girth ⋮ Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth ⋮ The minimum matching energy of bicyclic graphs with given girth ⋮ Matching Energy of Graphs with Maximum Degree at Most 3 ⋮ Matchings in graphs with a given number of cuts ⋮ The matching energy of graphs with given edge connectivity ⋮ Extremal bipartite graphs of given connectivity with respect to matching energy ⋮ On the minimal matching energies of unicyclic graphs ⋮ On ordering of complements of graphs with respect to matching numbers ⋮ On the k-matchings of the complements of bicyclic graphs ⋮ On the monotonicity of topological indices and the connectivity of a graph ⋮ 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 ⋮ On the coefficients of the independence polynomial of graphs ⋮ Extremal matching energy of complements of trees ⋮ Two classes of topological indices of phenylene molecule graphs ⋮ Lower bounds on matching energy of graphs ⋮ Extremal matching energy and the largest matching root of complete multipartite graphs ⋮ The matching energy of random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)
• The matching energy of a graph
• On the upper bounds of the numbers of perfect matchings in graphs with given parameters
• Recent results in the theory of graph spectra
• An introduction to matching polynomials
• Graph Energy
• On the theory of the matching polynomial

This page was built for publication: The matching energy of graphs with given parameters