Graphs with given number of cut vertices and extremal Merrifield-Simmons index

DOI10.1016/j.dam.2011.03.008zbMath1218.05114OpenAlexW2133086306MaRDI QIDQ548269

Hong-Bo Hua, Sheng Gui Zhang

Publication date: 28 June 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.03.008

zbMATH Keywords

boundindependent setsextremal graphcut vertexMerrifield-Simmons index

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

On Sombor Index of Graphs with a Given Number of Cut-Vertices ⋮ Extremal \(H\)-colorings of trees and 2-connected graphs ⋮ Proofs to some open problems on the maximum Sombor index of graphs ⋮ Further results on the Merrifield-Simmons index ⋮ Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices ⋮ On conjecture of Merrifield-Simmons index ⋮ Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs ⋮ On the Merrifield-Simmons index of tricyclic graphs

Cites Work

• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
• 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
• 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

This page was built for publication: Graphs with given number of cut vertices and extremal Merrifield-Simmons index