The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs
From MaRDI portal
Publication:2389902
DOI10.1016/j.mcm.2008.06.009zbMath1165.05337OpenAlexW1988202736MaRDI QIDQ2389902
Publication date: 20 July 2009
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2008.06.009
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (11)
A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ The Hosoya index and the Merrifield-Simmons index ⋮ The number of independent sets of tricyclic graphs ⋮ The Merrifield-Simmons index and Hosoya index of \(C(n, k, \lambda)\) graphs ⋮ On the number of independent subsets in trees with restricted degrees ⋮ On the number of independent sets in cycle-separated tricyclic graphs ⋮ Graphs with maximal Hosoya index and minimal Merrifield-Simmons index ⋮ Orderings of a class of trees with respect to the Merrifield-Simmons index and the Hosoya index ⋮ The minimum Merrifield-Simmons index of unicyclic graphs with diameter at most four ⋮ On the Merrifield-Simmons index of tricyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Merrifield-Simmons index in \((n,n+ 1)\)-graphs
- The smallest hosoya index in \((n,n+1)\)-graphs
- On the ordering of graphs with respect to their matching numbers
- Extremal catacondensed benzenoids
- On minimal energy ordering of acyclic conjugated molecules
- 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 number of independent sets in unicyclic graphs
This page was built for publication: The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs