The matching energy of graphs with given edge connectivity
DOI10.1186/S13660-015-0938-3zbMATH Open1329.05190OpenAlexW151824383WikidataQ59434016 ScholiaQ59434016MaRDI QIDQ903380FDOQ903380
Authors: Shengjin Ji, Hongping Ma, 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
Recommendations
- The matching energy of graphs with given parameters
- The extremal matching energy of graphs.
- Matching Energy of Graphs with Maximum Degree at Most 3
- The minimal matching energy of \((n,m)\)-graphs with a given matching number
- Extremal bipartite graphs of given connectivity with respect to matching energy
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Graph energy
- Graph energy
- Title not available (Why is that?)
- Borderenergetic graphs
- Title not available (Why is that?)
- Recent results in the theory of graph spectra
- Maximum and minimum energy trees with two and three branched vertices
- Relation between energy and (signless) Laplacian energy of graphs
- An introduction to matching polynomials
- On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3
- The matching energy of random graphs
- On a conjecture about tricyclic graphs with maximal energy
- Graphs with extremal matching energies and prescribed parameters
- Title not available (Why is that?)
- Maximal matching energy of tricyclic graphs
- Finding the least element of the ordering of graphs with respect to their matching numbers
- On minimum matching energy of graphs
- Bounds on the matching energy of unicyclic odd-cycle graphs
- Extremal matching energy of bicyclic graphs
- The extremal matching energy of graphs.
- On the tree with diameter 4 and maximal energy
- The matching energy of a graph
- The matching energy of graphs with given parameters
- Complete solution to a conjecture on the fourth maximal energy tree
- Effects on the energy and Estrada indices by adding edges among pendent vertices
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- New bounds on the incidence energy, Randić energy and Randić Estrada index
- A note on Randić energy
- An approach to the problem of the maximal energy of bicyclic graphs
- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- Title not available (Why is that?)
- Extremal matching energy of complements of trees
Cited In (10)
- On the k-matchings of the complements of bicyclic graphs
- Connectivity measures in matched sum graphs
- A complete description of convex sets associated with matchings and edge‐connectivity in graphs
- The minimum matching energy of bicyclic graphs with given girth
- Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
- The matching energy of graphs with given parameters
- The extremal matching energy of graphs.
- Matching Energy of Graphs with Maximum Degree at Most 3
- The matching energy of random graphs
- Extremal bipartite graphs of given connectivity with respect to matching energy
This page was built for publication: The matching energy of graphs with given edge connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903380)
