Pages that link to "Item:Q1823265"
From MaRDI portal
The following pages link to Bipartite graphs can have any number of independent sets (Q1823265):
Displayed 9 items.
- Cacti with the maximum Merrifield-Simmons index and given number of cut edges (Q602824) (← links)
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index (Q607700) (← links)
- Unicycle graphs with extremal Merrifield-Simmons index (Q926924) (← links)
- The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices (Q937620) (← links)
- The inverse problem for certain tree parameters (Q967387) (← links)
- A sharp upper bound for the number of stable sets in graphs with given number of cut edges (Q1033025) (← links)
- The number of maximal independent sets in connected triangle-free graphs (Q1292823) (← links)
- Graphs, partitions and Fibonacci numbers (Q2370416) (← links)
- Constraints on the number of maximal independent sets in graphs (Q4284106) (← links)