Pages that link to "Item:Q2231772"
From MaRDI portal
The following pages link to The number of subtrees in graphs with given number of cut edges (Q2231772):
Displaying 9 items.
- A sharp upper bound for the number of stable sets in graphs with given number of cut edges (Q1033025) (← links)
- Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982) (← links)
- Enumeration of subtrees of planar two-tree networks (Q2168574) (← links)
- Maximum number of subtrees in cacti and block graphs (Q2172841) (← links)
- On the number of subtrees for almost all graphs (Q4288890) (← links)
- Subtrees of graphs (Q4646947) (← links)
- Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices (Q6064850) (← links)
- Extremal problems for connected set enumeration (Q6094711) (← links)
- Computing the number and average size of connected sets in planar 3-trees (Q6540641) (← links)