Pages that link to "Item:Q1953360"
From MaRDI portal
The following pages link to Further analysis on the total number of subtrees of trees (Q1953360):
Displaying 15 items.
- Greedy trees, subtrees and antichains (Q396846) (← links)
- The minimal number of subtrees of a tree (Q489363) (← links)
- Permanental bounds of the Laplacian matrix of trees with given domination number (Q497337) (← links)
- Extremal problems for trees with given segment sequence (Q507572) (← links)
- Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← links)
- On the coefficients of the independence polynomial of graphs (Q2012888) (← links)
- Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982) (← links)
- Independence polynomials of bipartite graphs (Q2091140) (← links)
- Maximum number of subtrees in cacti and block graphs (Q2172841) (← links)
- The number of subtrees in graphs with given number of cut edges (Q2231772) (← links)
- On the number of connected subgraphs of graphs (Q2243091) (← links)
- Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
- The number of subtrees of trees with given diameter (Q4603866) (← links)
- Extremal problems for connected set enumeration (Q6094711) (← links)
