Shujing Wang

most citedEnumerating the total number of subtrees of trees

6 citations · 7 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2014

On graphs with maximum Harary spectral radius

Fei Huang, Xueliang Li, Shujing Wang

Let $G$ be a simple graph with vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ . The Harary matrix $R D (G)$ of $G$ , which is initially called the reciprocal distance matrix, is an $n \…

math.CO2014

On maximum Estrada indices of bipartite graphs with some given parameters

Fei Huang, Xueliang Li, Shujing Wang

The Estrada index of a graph $G$ is defined as $E E (G) = \sum_{i = 1}^{n} e^{λ_{i}}$ , where $λ_{1},$ $λ_{2}, \dots, λ_{n}$ are the eigenvalues of the adjacency matrix of $G$ . In this paper, we ch…

math.CO2012★ 6 cited

Enumerating the total number of subtrees of trees

Shuchao Li, Shujing Wang

Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of th…

math.CO2012★ 1 cited

Further analysis on the total number of subtrees of trees

Shuchao Li, Shujing Wang

We study that over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees. Trees minimizing (resp. maximizing) the total…