Pages that link to "Item:Q1033025"
From MaRDI portal
The following pages link to A sharp upper bound for the number of stable sets in graphs with given number of cut edges (Q1033025):
Displaying 9 items.
- Independent sets in graphs (Q501998) (← links)
- Graphs with given number of cut vertices and extremal Merrifield-Simmons index (Q548269) (← links)
- On the number of independent subsets in trees with restricted degrees (Q552058) (← links)
- Two problems on independent sets in graphs (Q641174) (← links)
- Matrix formulation of EISs of graphs and its application to WSN covering problems (Q2036024) (← links)
- Further results on the Merrifield-Simmons index (Q2192080) (← links)
- Maximum number of fixed points in AND-OR-NOT networks (Q2453540) (← links)
- Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices (Q2687504) (← links)
- Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree (Q5418775) (← links)
