On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number (Q963818)

Let \(C(n,k)\) be the class of all graphs of order \(n\) and the clique number \(k\). The author shows that in \(C(n,k)\) the Turan graph has the maximum number of matchings and the minimum number of independent sets. On other hand it is shown that the graph obtained from the complete graph \(G\) by adding new edges incident with a vertex of \(G\) has the maximum number of independent sets and the minimum number of matchings among all graphs in \(C(n,k).\)