The Merrifield-Simmons index and Hosoya index of \(C(n, k, \lambda)\) graphs

DOI10.1155/2012/520156zbMath1255.05133DBLPjournals/jam/DaiZ12OpenAlexW1504126827WikidataQ58906054 ScholiaQ58906054MaRDI QIDQ1760722

Shaojun Dai, Ruihai Zhang

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1155/2012/520156

zbMATH Keywords

Hosoya indexMerrifield-Simmons indexnumber of matchingsnumber of independent vertex sets

Mathematics Subject Classification ID

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 (1)

The minimum Merrifield-Simmons index of unicyclic graphs with diameter at most four

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the ordering of graphs with respect to their matching numbers
• A theorem of Littlewood, Orlicz, and Grothendieck about sums in \(L^1(0,1)\)
• On acyclic systems with minimal Hosoya index
• A note on the number of matchings and independent sets in trees
• The largest Hosoya index of \((n,n+1)\)-graphs
• The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs

This page was built for publication: The Merrifield-Simmons index and Hosoya index of \(C(n, k, \lambda)\) graphs