A sharp upper bound for the number of stable sets in graphs with given number of cut edges

DOI10.1016/j.aml.2009.03.011zbMath1173.05333OpenAlexW2079920416MaRDI QIDQ1033025

Hong-Bo Hua

Publication date: 6 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.aml.2009.03.011

zbMATH Keywords

upper boundstable setextremal graphcut edge2-edge-connected graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (9)

Further results on the Merrifield-Simmons index ⋮ Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices ⋮ Two problems on independent sets in graphs ⋮ Maximum number of fixed points in AND-OR-NOT networks ⋮ Independent sets in graphs ⋮ Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree ⋮ Graphs with given number of cut vertices and extremal Merrifield-Simmons index ⋮ On the number of independent subsets in trees with restricted degrees ⋮ Matrix formulation of EISs of graphs and its application to WSN covering problems

Cites Work

• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• Bipartite graphs can have any number of independent sets
• The number of independent sets in unicyclic graphs
• Enumeration of structure-sensitive graphical subsets: Theory
• Enumeration of structure-sensitive graphical subsets: Calculations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A sharp upper bound for the number of stable sets in graphs with given number of cut edges