The matching energy of a graph
From MaRDI portal
Publication:713314
DOI10.1016/j.dam.2012.06.001zbMath1252.05120OpenAlexW2096318439MaRDI QIDQ713314
Ivan Gutman, Stephan G. Wagner
Publication date: 26 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.06.001
Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (43)
The Minimum Edge Covering Energy of a Graph ⋮ Iota energy orderings of bicyclic signed digraphs ⋮ The maximum matching energy of bicyclic graphs with even girth ⋮ Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth ⋮ The bounds of the energy and Laplacian energy of chain graphs ⋮ Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems ⋮ On eigenvalues and the energy of dendrimer trees ⋮ The minimum matching energy of bicyclic graphs with given girth ⋮ Ordering of the unicyclic signed graphs with perfect matchings by their minimal energies ⋮ The weighted vertex PI index of bicyclic graphs ⋮ The average size of matchings in graphs ⋮ On the sharp bounds of bicyclic graphs regarding edge Szeged index ⋮ Matching Energy of Graphs with Maximum Degree at Most 3 ⋮ Matchings in graphs with a given number of cuts ⋮ Wiener polarity index of dendrimers ⋮ The matching energy of graphs with given edge connectivity ⋮ On the signless Laplacian coefficients of unicyclic graphs ⋮ 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 ⋮ Extremal iota energy of bicyclic digraphs ⋮ The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies ⋮ On energy and Laplacian energy of bipartite graphs ⋮ 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 ⋮ Energy of matrices ⋮ Further results on the largest matching root of unicyclic graphs ⋮ Bicyclic signed graphs with minimal and second minimal energy ⋮ On the ordering of bicyclic digraphs with respect to energy and iota energy ⋮ Further results on monotonic graph invariants and bipartiteness number ⋮ Extremal matching energy of complements of trees ⋮ Two classes of topological indices of phenylene molecule graphs ⋮ On the extremal graphs with respect to the total reciprocal edge-eccentricity ⋮ 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 ⋮ Topological energy of the distance matrix ⋮ Cycle energy and its size dependence ⋮ Extremal matching energy and the largest matching root of complete multipartite graphs ⋮ On the edge-Szeged index of unicyclic graphs with given diameter ⋮ Bounds on the weighted vertex PI index of cacti graphs ⋮ The matching energy of random graphs
Cites Work
- Extremal energies of trees with a given domination number
- On the maximal energy tree with two maximum degree vertices
- The energy of graphs and matrices
- Strongly regular graphs with maximal energy
- On the ordering of graphs with respect to their matching numbers
- Recent results in the theory of graph spectra
- An introduction to matching polynomials
- Topological approach to the chemistry of conjugated molecules
- Bounds for the Hückel energy of a graph
- Note on the Coulson integral formula
- Theory of monomer-dimer systems
- Graph Energy
- On the Arithmetic and Geometric Means and on Holder's Inequality
- On the theory of the matching polynomial
- The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
- Maximal energy graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The matching energy of a graph
