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

DOI10.1016/J.AML.2009.03.011MaRDI QIDQ1033025zbMATH OpenOpenAlexFDO

Authors Hongbo 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

2-edge-connected graphcut edgeextremal graphstable setupper bound

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Extremal graphs having no stable cutset
• An exact lower bound on the number of cut‐sets in multigraphs
• scientific article; zbMATH DE number 1933044
• The number of subtrees in graphs with given number of cut edges
• Extremal problems for connected set enumeration

Cites work

• Bipartite graphs can have any number of independent sets
• Enumeration of structure-sensitive graphical subsets: Calculations
• Enumeration of structure-sensitive graphical subsets: Theory
• scientific article; zbMATH DE number 1823785 (Why is no real title available?)
• scientific article; zbMATH DE number 4179416 (Why is no real title available?)
• 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 528857 (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?)
• scientific article; zbMATH DE number 969166 (Why is no real title available?)
• On the Fibonacci numbers of trees
• On the Merrifield-Simmons index of trees
• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• The number of independent sets in unicyclic graphs

Cited in

(11)

• Matrix formulation of EISs of graphs and its application to WSN covering problems
• Further results on the Merrifield-Simmons index
• Maximum number of fixed points in AND-OR-NOT networks
• Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices
• The number of all stable sets in some classes of graphs
• Independent sets in graphs
• Sharp bounds on the order, size, and stability number of 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
• Two problems on independent sets in graphs

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

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