5 citations · 15 across the 19 of their papers we have counts for
19 papers
Extremal values for Steiner distances and the Steiner -Wiener index
Hua Wang, Andrew Zhang
Various questions related to distances between vertices of simple, finite graphs are of interest to extremal graph theorists. The Steiner distance of a set of vertices is a nat…
Subtrees and BC-subtrees of maximum degree no more than k in trees
Yu Yang, Xiao-xiao Li, Meng-yuan Jin +3
The subtrees and BC-subtrees (subtrees where any two leaves are at even distance apart) have been extensively studied in recent years. Such structures, under special constraints on…
On the maximum mean subtree order of trees
Stijn Cambie, Stephan Wagner, Hua Wang
A subtree of a tree is any induced subgraph that is again a tree (i.e., connected). The mean subtree order of a tree is the average number of vertices of its subtrees. This invaria…
The Steiner Wiener index of trees with a given segment sequence
Jie Zhang, Hua Wang, Xiao-Dong Zhang
The Steiner distance of vertices in a set is the minimum size of a connected subgraph that contain these vertices. The sum of the Steiner distances over all sets of cardina…
The expected subtree number index in random polyphenylene and spiro chains
Yu Yang, Xiao-Jun Sun, Jia-Yi Cao +2
Subtree number index of a graph is the number of nonempty subtrees of . It is a structural and counting based topological index that has received more and mo…
Restricted Color -color Compositions
Brian Hopkins, Hua Wang
Agarwal introduced -color compositions in 2000 and most subsequent research has focused on restricting which parts are allowed. Here we focus instead on restricting allowed colo…