The matching energy of graphs with given edge connectivity

DOI10.1186/S13660-015-0938-3MaRDI QIDQ903380zbMATH OpenOpenAlexWikidataFDO

Authors Shengjin Ji, Hongping Ma, Gang Ma

Publication date 5 January 2016

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s13660-015-0938-3

zbMATH Keywords

matchingextremal graphmatching energygraph energyedge connectivity

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1618184 (Why is no real title available?)
• scientific article; zbMATH DE number 4074878 (Why is no real title available?)
• scientific article; zbMATH DE number 3679880 (Why is no real title available?)
• scientific article; zbMATH DE number 6271723 (Why is no real title available?)
• A note on Randić energy
• An approach to the problem of the maximal energy of bicyclic graphs
• An introduction to matching polynomials
• Borderenergetic graphs
• Bounds on the matching energy of unicyclic odd-cycle graphs
• Complete solution to a conjecture on the fourth maximal energy tree
• Effects on the energy and Estrada indices by adding edges among pendent vertices
• Extremal matching energy of bicyclic graphs
• Extremal matching energy of complements of trees
• Finding the least element of the ordering of graphs with respect to their matching numbers
• Graph energy
• Graph energy
• Graph theory
• Graphs with extremal matching energies and prescribed parameters
• Maximal matching energy of tricyclic graphs
• Maximum and minimum energy trees with two and three branched vertices
• New bounds on the incidence energy, Randić energy and Randić Estrada index
• Novel inequalities for generalized graph entropies -- graph energies and topological indices
• On a conjecture about tricyclic graphs with maximal energy
• On minimum matching energy of graphs
• On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3
• On the tree with diameter 4 and maximal energy
• Recent results in the theory of graph spectra
• Relation between energy and (signless) Laplacian energy of graphs
• Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
• The extremal matching energy of graphs.
• The matching energy of a graph
• The matching energy of graphs with given parameters
• The matching energy of random graphs

Cited in

(11)

• Matching Energy of Graphs with Maximum Degree at Most 3
• Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
• The matching energy of \(k\)-trees.
• A complete description of convex sets associated with matchings and edge‐connectivity in graphs
• On the k-matchings of the complements of bicyclic graphs
• Connectivity measures in matched sum graphs
• The matching energy of graphs with given parameters
• The minimum matching energy of bicyclic graphs with given girth
• The extremal matching energy of graphs.
• 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)