Pages that link to "Item:Q5454258"

The following pages link to Correlation of Graph‐Theoretical Indices (Q5454258):

Displaying 27 items.

• The minimal number of subtrees of a tree (Q489363) (← links)
• The minimal number of subtrees with a given degree sequence (Q489367) (← links)
• Extremal problems for trees with given segment sequence (Q507572) (← links)
• The sum of the distances between the leaves of a tree and the `semi-regular' property (Q539876) (← links)
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index (Q607700) (← links)
• Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
• The distances between internal vertices and leaves of a tree (Q740265) (← links)
• On the eccentric subtree number in trees (Q827611) (← links)
• The extremal values of the Wiener index of a tree with given degree sequence (Q948686) (← links)
• On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← links)
• Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982) (← links)
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
• The expected subtree number index in random polyphenylene and spiro chains (Q2197461) (← links)
• The number of subtrees in graphs with given number of cut edges (Q2231772) (← links)
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← links)
• Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
• Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs (Q2286143) (← links)
• A central limit theorem for almost local additive tree functionals (Q2292863) (← links)
• Analyzing lattice networks through substructures (Q2318224) (← links)
• Enumeration of BC-subtrees of trees (Q2344772) (← links)
• Extremal values of ratios: distance problems vs. subtree problems in trees. II (Q2436831) (← links)
• The number of subtrees of trees with given diameter (Q4603866) (← links)
• (Q4993555) (← links)
• The Number of Subtrees of Trees with Given Degree Sequence (Q5325940) (← links)
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)
• Extremal problems for connected set enumeration (Q6094711) (← links)
• Computing the number and average size of connected sets in planar 3-trees (Q6540641) (← links)