Correlation of Graph‐Theoretical Indices

From MaRDI portal
Publication:5454258


DOI10.1137/050631446zbMath1144.05009MaRDI QIDQ5454258

Stephan G. Wagner

Publication date: 28 March 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050631446


05C05: Trees

05A15: Exact enumeration problems, generating functions

05A16: Asymptotic enumeration


Related Items

The number of subtrees of trees with given diameter, Unnamed Item, The Number of Subtrees of Trees with Given Degree Sequence, Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs, Extremal problems for connected set enumeration, The minimal number of subtrees of a tree, The minimal number of subtrees with a given degree sequence, Extremal problems for trees with given segment sequence, The sum of the distances between the leaves of a tree and the `semi-regular' property, Maxima and minima of the Hosoya index and the Merrifield-Simmons index, Subtrees of spiro and polyphenyl hexagonal chains, The distances between internal vertices and leaves of a tree, On the eccentric subtree number in trees, The extremal values of the Wiener index of a tree with given degree sequence, On \(\sigma\)-span and \(F\)-span of trees and full binary trees, Cut and pendant vertices and the number of connected induced subgraphs of a graph, On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees, The expected subtree number index in random polyphenylene and spiro chains, The number of subtrees in graphs with given number of cut edges, Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees, Some extremal ratios of the distance and subtree problems in binary trees, Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs, A central limit theorem for almost local additive tree functionals, Analyzing lattice networks through substructures, Enumeration of BC-subtrees of trees, Extremal values of ratios: distance problems vs. subtree problems in trees. II