The matching energy of graphs with given edge connectivity
From MaRDI portal
Publication:903380
DOI10.1186/s13660-015-0938-3zbMath1329.05190OpenAlexW151824383WikidataQ59434016 ScholiaQ59434016MaRDI QIDQ903380
Hongping Ma, Shengjin Ji, Gang Ma
Publication date: 5 January 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0938-3
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (3)
Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth ⋮ The minimum matching energy of bicyclic graphs with given girth ⋮ On the k-matchings of the complements of bicyclic graphs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- On the tree with diameter 4 and maximal energy
- The matching energy of a graph
- Extremal matching energy of complements of trees
- The matching energy of graphs with given parameters
- Recent results in the theory of graph spectra
- An introduction to matching polynomials
- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3
- The matching energy of random graphs
- Graph Energy
- On a conjecture about tricyclic graphs with maximal energy
- The Maximal Matching Energy of Tricyclic Graphs
- The matching energy of graphs with given edge connectivity
This page was built for publication: The matching energy of graphs with given edge connectivity
