Tricyclic graphs with maximum Merrifield-Simmons index
From MaRDI portal
Publication:968130
DOI10.1016/j.dam.2009.09.001zbMath1226.05145MaRDI QIDQ968130
Shuchao Li, Liansheng Tan, Zhongxun Zhu
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.001
05C35: Extremal problems in graph theory
05C90: Applications of graph theory
05C38: Paths and cycles
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Related Items
The number of independent sets in a connected graph and its complement, On the lower and upper bounds for different indices of tricyclic graphs, The number of independent sets of tricyclic graphs, On the number of independent sets in cycle-separated tricyclic graphs, Maxima and minima of the Hosoya index and the Merrifield-Simmons index, The number of independent sets of unicyclic graphs with given matching number, Trees with given stability number and minimum number of stable sets, Extremal phenylene chains with respect to the coefficients sum of the permanental polynomial, the spectral radius, the Hosoya index and the Merrifield-Simmons index, On the Merrifield-Simmons index of tricyclic graphs, Orderings of a class of trees with respect to the Merrifield-Simmons index and the Hosoya index, Counting independent sets in tricyclic graphs
Cites Work
- Double hexagonal chains with maximal Hosoya index and minimal Merrifield-Simmons index
- The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
- The spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent vertices
- The Merrifield-Simmons index in \((n,n+ 1)\)-graphs
- On the nullity of graphs with pendent vertices
- The number of independent sets in unicyclic graphs with a given diameter
- On the index of tricyclic graphs with perfect matchings
- Extremal catacondensed benzenoids
- Extremal hexagonal chains concerning largest eigenvalue
- The number of independent sets in unicyclic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item