scientific article
From MaRDI portal
Publication:3377673
zbMath1084.05018MaRDI QIDQ3377673
Ivan Gutman, Xue Liang Li, Hai-xing Zhao
Publication date: 28 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Graphs, partitions and Fibonacci numbers ⋮ A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs ⋮ Cacti with the maximum Merrifield-Simmons index and given number of cut edges ⋮ Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ Trees with given stability number and minimum number of stable sets ⋮ A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs ⋮ On Hosoya Index and Merrifield‐Simmons Index of trees with given domination number ⋮ Further results on the Merrifield-Simmons index ⋮ The Hosoya Index and the Merrifield–Simmons Index of Some Nanostructures ⋮ Merrifield-simmons index in random phenylene chains and random hexagon chains ⋮ The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices ⋮ Extremal problems for trees with given segment sequence ⋮ Independent vertex sets in the Zykov sum ⋮ On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs ⋮ Tricyclic graphs with maximum Merrifield-Simmons index ⋮ Independence polynomials of \(k\)-tree related graphs ⋮ Graphs with given number of cut vertices and extremal Merrifield-Simmons index ⋮ On the Hosoya index of graphs ⋮ On the number of independent sets in cycle-separated tricyclic graphs ⋮ Ordering trees with given pendent vertices with respect to Merrifield-Simmons indices and Hosoya indices ⋮ The number of independent sets in a connected graph and its complement ⋮ Trees with a given number of leaves and the maximal number of maximum independent sets ⋮ The number of independent sets in unicyclic graphs with a given diameter ⋮ A sharp upper bound for the number of stable sets in graphs with given number of cut edges ⋮ Fibonacci index and stability number of graphs: a polyhedral study ⋮ Turán Graphs, Stability Number, and Fibonacci Index
This page was built for publication:
