Shujing Wang

activity

20122023

most citedProper connection number and 2-proper connection number of a graph

13 citations · 25 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2023

On Seymour's and Sullivan's Second Neighbourhood Conjectures

Jiangdong Ai, Stefanie Gerke, Gregory Gutin +3

For a vertex $x$ of a digraph, $d^{+} (x)$ ( $d^{-} (x)$ , resp.) is the number of vertices at distance 1 from (to, resp.) $x$ and $d^{++} (x)$ is the number of vertices at distance 2 from…

math.CO2018

The energy of random signed graph

Shuchao Li, Shujing Wang

A signed graph $Γ (G)$ is a graph with a sign attached to each of its edges, where $G$ is the underlying graph of $Γ (G)$ . The energy of a signed graph $Γ (G)$ is the sum of the absol…

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 $σ (T)$ and the number of subtrees $F (T)$ 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 $k$ -proper connected i…

math.CO2015★ 4 cited

Proper connection numbers of complementary graphs

Fei Huang, Xueliang Li, Shujing Wang

A path $P$ in an edge-colored graph $G$ is called a proper path if no two adjacent edges of $P$ are colored the same, and $G$ is proper connected if every two vertices of $G$ are c…

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…