13 citations · 18 across the 3 of their papers we have counts for
3 papers
math.CO2017★ 1 cited
Some extremal ratios of the distance and subtree problems in binary trees
Shuchao Li, Hua Wang, Shujing Wang
Among many topological indices of trees the sum of distances and the number of subtrees have been a long standing pair of graph invariants that are well known for the…
math.CO2015★ 13 cited
Proper connection number and 2-proper connection number of a graph
Fei Huang, Xueliang Li, Shujing Wang
A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored with one same color. An edge-colored graph is called -proper connected i…
math.CO2015★ 4 cited
Proper connection numbers of complementary graphs
Fei Huang, Xueliang Li, Shujing Wang
A path in an edge-colored graph is called a proper path if no two adjacent edges of are colored the same, and is proper connected if every two vertices of are c…