| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871378 | Discrete Applied Mathematics | 2018 | 6 Pages |
Abstract
The matching energy of a graph G is ME(G)=2Ïâ«0â1x2ln[âkâ¥0m(G,k)x2k]dx, and the Hosoya index of G is Z(G)=âkâ¥0m(G,k), where m(G,k) is the number of k-matchings in G. In this note, we first determine the maximum values of m(G,k) in all connected bipartite graphs with n vertices and a given connectivity. And then we determine the maximum matching energy (resp. Hosoya index) among all connected bipartite graphs with n vertices and a given (edge) connectivity and characterize the corresponding extremal graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hanlin Chen, Hanyuan Deng,