The matching energy of graphs with given parameters
DOI10.1016/J.DAM.2013.09.014zbMATH Open1300.05162OpenAlexW1990362489MaRDI QIDQ741776FDOQ741776
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
Recommendations
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)
Cites Work
- Graph theory
- Graph energy
- Graph energy
- An introduction to the theory of graph spectra
- Title not available (Why is that?)
- On the theory of the matching polynomial
- Recent results in the theory of graph spectra
- An introduction to matching polynomials
- Title not available (Why is that?)
- The matching energy of a graph
- The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)
- On the upper bounds of the numbers of perfect matchings in graphs with given parameters
Cited In (22)
- On the k-matchings of the complements of bicyclic graphs
- Extremal matching energy and the largest matching root of complete multipartite graphs
- On ordering of complements of graphs with respect to matching numbers
- The maximum matching energy of bicyclic graphs with even girth
- The minimum matching energy of bicyclic graphs with given girth
- Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
- The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
- Lower bounds on matching energy of graphs
- Extremal matching energy of complements of trees
- Matchings in graphs with a given number of cuts
- On the coefficients of the independence polynomial of graphs
- Graphs with extremal matching energies and prescribed parameters
- Title not available (Why is that?)
- Two classes of topological indices of phenylene molecule graphs
- Matchings in bipartite graphs with a given number of cuts
- Matching Energy of Graphs with Maximum Degree at Most 3
- The matching energy of random graphs
- The matching energy of graphs with given edge connectivity
- Extremal bipartite graphs of given connectivity with respect to matching energy
- On the monotonicity of topological indices and the connectivity of a graph
- Extremal values of matching energies of one class of graphs
- On the minimal matching energies of unicyclic 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)
