Pages that link to "Item:Q5737871"

The following pages link to Trees with large numbers of subtrees (Q5737871):

Displaying 9 items.

• On subtree number index of generalized book graphs, fan graphs, and wheel graphs (Q2035665) (← links)
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
• Enumeration of subtrees of planar two-tree networks (Q2168574) (← links)
• The expected subtree number index in random polyphenylene and spiro chains (Q2197461) (← links)
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← links)
• On the number of connected subgraphs of graphs (Q2243091) (← links)
• Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs (Q5039404) (← links)
• Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices (Q6064850) (← links)
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)