Bipartite cacti with extremal matching energy

Jinfeng Liu and Fei Huang

Applied Mathematics and Computation, 2024, vol. 480, issue C

Abstract: Let m(H,t) be the number of matchings containing t edges in a graph H. Define a quasi-order ⪰ by H⪰F if m(H,t)≥m(F,t) holds for all t. Let BC(a,b,r) be the set of all bipartite cacti with r cycles and a given bipartition (A,B), where |A|=a, |B|=b. We determine the extremal graphs minimize the matching energy in BC(a,b,r) for a−b≥r−2.

Keywords: Matching; Quasi-order; Matching energy; Cactus; Bipartition (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032400376X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:480:y:2024:i:c:s009630032400376x

DOI: 10.1016/j.amc.2024.128915

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().