Matchings in bipartite graphs with a given number of cuts

DOI10.1016/j.dam.2024.08.012MaRDI QIDQ6633545

Fei Huang, Jinfeng Liu

Publication date: 6 November 2024

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

zbMATH Keywords

bipartite graphsmatchingscut edgecut vertexHosoya indexquasi-order

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Extremal values of matching energies of one class of graphs
• The matching energy of a graph
• The matching energy of graphs with given parameters
• Minimum energy on trees with \(k\) pendent vertices
• An introduction to matching polynomials
• Extremal bipartite graphs of given connectivity with respect to matching energy
• Matchings in graphs with a given number of cuts
• Graph Energy
• On the theory of the matching polynomial
• The Maximal Matching Energy of Tricyclic Graphs

This page was built for publication: Matchings in bipartite graphs with a given number of cuts