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

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

collaborators

7 papers

math.NT2025

On -Shuffle Relations for Multiple Eisenstein Series of Arbitrary Rank in Positive Characteristic

Ting-Wei Chang, Song-Yun Chen, Fei-Jun Huang +1

In this paper, we define the multiple Eisenstein series of arbitrary rank in positive characteristic, with Thakur's multiple zeta values appearing as the "constant terms" of their…

math.CO2016

Solution to a conjecture on the proper connection number of graphs

Fei Huang, Xueliang Li, Zhongmei Qin +1

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph , the proper connection number …

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…

math.CO2014★ 1 cited

Skew Randić Matrix and Skew Randić Energy

Ran Gu, Fei Huang, Xueliang Li

Let be a simple graph with an orientation , which assigns to each edge a direction so that becomes a directed graph. is said to be the underlying graph of the dire…

math.CO2014★ 7 cited

Randić Incidence Energy of Graphs

Ran Gu, Fei Huang, Xueliang Li

Let be a simple graph with vertex set and edge set . Similar to the Randić matrix, here we introduce the Rand…

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 is defined as , where are the eigenvalues of the adjacency matrix of . In this paper, we ch…