Upper bounds for the average size of maximal matchings in bicyclic graphs
For a graph $G$, let avm($G$) denote the average size of its maximal matchings. Engbers and Erey initiated the extremal study of this parameter and asked for extensions from trees and unicyclic graphs to $k$-cyclic graphs. In this paper, we determine the maximum value of avm($G$) over all connected bicyclic graphs with...