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

Showing 2014Show all

2 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…