The bipartite unicyclic graphs with the first ⌊n−34⌋ largest matching energies

Lin Chen and Jinfeng Liu

Applied Mathematics and Computation, 2015, vol. 268, issue C, 644-656

Abstract: The theory of matching energy of graphs since been proposed by Gutman and Wagner in 2012, has attracted more and more attention. It is denoted by Bn,m, the class of bipartite graphs with order n and size m. In particular, Bn,n denotes the set of bipartite unicyclic graphs, which is an interesting class of graphs. In this paper, for odd n, we characterize the bipartite unicyclic graphs with the first ⌊n−34⌋ largest matching energies. There is an interesting correspondence: we conclude that the graph with the second maximal matching energy in Bn,n for odd n ≥ 11 is Pn6, which is the only graph attaining the maximum value of the energy among all the (bipartite) unicyclic graphs for n ≥ 16.

Keywords: Matching energy; Bipartite unicyclic graphs; Quasi-order; Coulson integral formula (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315008966
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:268:y:2015:i:c:p:644-656

DOI: 10.1016/j.amc.2015.06.115

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 ().