Extremal bipartite graphs of given connectivity with respect to matching energy

DOI10.1016/J.DAM.2018.01.003zbMath1382.05035OpenAlexW2791760227MaRDI QIDQ1706135

Hanyuan Deng, Han Lin Chen

Publication date: 21 March 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.01.003

zbMATH Keywords

bipartite graphconnectivitymatching energyHosoya index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (1)

Matchings in graphs with a given number of cuts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum matching energy of bicyclic graphs with even girth
• The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain
• The minimum matching energy of bicyclic graphs with given girth
• The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)
• 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
• The matching energy of a graph
• The matching energy of graphs with given parameters
• An introduction to matching polynomials
• On the monotonicity of topological indices and the connectivity of a graph
• The matching energy of random graphs
• The Maximal Matching Energy of Tricyclic Graphs

This page was built for publication: Extremal bipartite graphs of given connectivity with respect to matching energy