Pages that link to "Item:Q2040982"
From MaRDI portal
The following pages link to Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982):
Displaying 6 items.
- On the number of cut-vertices in a graph (Q1123210) (← links)
- The number of subtrees in graphs with given number of cut edges (Q2231772) (← links)
- Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs (Q5039404) (← links)
- Maximising the number of connected induced subgraphs of unicyclic graphs (Q5879474) (← links)
- Extremal problems for connected set enumeration (Q6094711) (← links)
- Upper bounds for some graph invariants in terms of blocks and cut-vertices (Q6657261) (← links)