The matching energy of graphs with given parameters

DOI10.1016/J.DAM.2013.09.014MaRDI QIDQ741776zbMATH OpenOpenAlexFDO

Authors Shuli Li, Weigen Yan

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

chromatic numberconnectivitymatching energy

Mathematics Subject Classification ID

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

Recommendations

• Graphs with extremal matching energies and prescribed parameters
• The matching energy of graphs with given edge connectivity
• Matching Energy of Graphs with Maximum Degree at Most 3
• The extremal matching energy of graphs.
• Extremal matching energy of molecular graphs with given matching number two

Cites work

• scientific article; zbMATH DE number 1618184 (Why is no real title available?)
• scientific article; zbMATH DE number 3679880 (Why is no real title available?)
• An introduction to matching polynomials
• An introduction to the theory of graph spectra
• Graph energy
• Graph energy
• Graph theory
• On the theory of the matching polynomial
• On the upper bounds of the numbers of perfect matchings in graphs with given parameters
• Recent results in the theory of graph spectra
• The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)
• The matching energy of a graph

Cited in

(22)

• Matching Energy of Graphs with Maximum Degree at Most 3
• On the coefficients of the independence polynomial of graphs
• On ordering of complements of graphs with respect to matching numbers
• The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
• Lower bounds on matching energy of graphs
• Matchings in graphs with a given number of cuts
• The maximum matching energy of bicyclic graphs with even girth
• Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
• On the monotonicity of topological indices and the connectivity of a graph
• On the minimal matching energies of unicyclic graphs
• Extremal values of matching energies of one class of graphs
• On the k-matchings of the complements of bicyclic graphs
• The minimum matching energy of bicyclic graphs with given girth
• Extremal matching energy of complements of trees
• The matching energy of random graphs
• Two classes of topological indices of phenylene molecule graphs
• Graphs with extremal matching energies and prescribed parameters
• Matchings in bipartite graphs with a given number of cuts
• scientific article; zbMATH DE number 7410909 (Why is no real title available?)
• The matching energy of graphs with given edge connectivity
• Extremal bipartite graphs of given connectivity with respect to matching energy
• Extremal matching energy and the largest matching root of complete multipartite graphs

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

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