For a graph \(G\), the Merrifield-Simmons index \(i(G)\) and the Hosoya index \(z(G)\) are defined as the total number of independent sets and the total number of matchings of the graph \(G\), respectively. In this paper, we characterize the graphs with the maximal Merrifield-Simmons index and the minimal Hosoya index, respectively, among the bicyclic graphs on \(n\) vertices with a given girth \(g\).
1970-2025 CP (Manitoba, Canada) unless otherwise stated.