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

DOI10.1016/J.DAM.2011.03.008MaRDI QIDQ548269zbMATH OpenOpenAlexFDO

Authors Hongbo Hua, Shenggui 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

boundextremal graphindependent setscut vertexMerrifield-Simmons index

Mathematics Subject Classification ID

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

Recommendations

• Unicyclic graphs with given number of cut vertices and the maximal Merrifield-Simmons index
• Cacti with the maximum Merrifield-Simmons index and given number of cut edges
• On the Merrifield-Simmons index of graphs
• scientific article; zbMATH DE number 6148013
• \(\mathscr{M}_n^k\) graphs with maximal Merrifield-Simmons index

Cites work

• scientific article; zbMATH DE number 4074878 (Why is no real title available?)
• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• scientific article; zbMATH DE number 808335 (Why is no real title available?)
• scientific article; zbMATH DE number 1391668 (Why is no real title available?)
• A sharp upper bound for the number of stable sets in graphs with given number of cut edges
• An upper bound on the number of independent sets in a tree.
• Fibonacci index and stability number of graphs: a polyhedral study
• Graph theory
• Merrifield-Simmons index and minimum number of independent sets in short trees
• On the Fibonacci numbers of trees
• On the Merrifield-Simmons index of trees
• On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• The number of independent sets in unicyclic graphs
• The number of independent sets in unicyclic graphs with a given diameter

Cited in

(12)

• Extremal \(H\)-colorings of trees and 2-connected graphs
• On Sombor index of graphs with a given number of cut-vertices
• Cacti with the maximum Merrifield-Simmons index and given number of cut edges
• Some indices of graphs with more than one cut-edge.
• Proofs to some open problems on the maximum Sombor index of graphs
• On the Merrifield-Simmons index of tricyclic graphs
• Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs
• Unicyclic graphs with given number of cut vertices and the maximal Merrifield-Simmons index
• Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices
• Extremal multi-bridge graphs with respect to Merrifield-Simmons index.
• Further results on the Merrifield-Simmons index
• On conjecture of Merrifield-Simmons index

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548269)