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

DOI10.1016/j.aml.2009.11.005zbMath1218.05073OpenAlexW1992407206MaRDI QIDQ963818

Kexiang Xu

Publication date: 14 April 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.11.005

zbMATH Keywords

matchingindependent setclique numberHosoya indexMerrifield-Simmons index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ Comparison between Merrifield-Simmons index and Wiener index of graphs ⋮ THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH ⋮ The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\) ⋮ The Hosoya Index and the Merrifield–Simmons Index of Some Nanostructures ⋮ Extremal colorings and independent sets ⋮ On the number of independent sets in cycle-separated tricyclic graphs ⋮ On the coefficients of the independence polynomial of graphs ⋮ On the Merrifield-Simmons index of tricyclic graphs

Cites Work

• On the minimal energy of trees with a given diameter
• The Merrifield-Simmons index in \((n,n+ 1)\)-graphs
• The smallest hosoya index in \((n,n+1)\)-graphs
• On acyclic systems with minimal Hosoya index
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item