activity
20142021
most citedThe Aging Effect in Evolving Scientific Citation Networks

36 citations · 45 across the 8 of their papers we have counts for

collaborators

8 papers

physics.soc-ph2021★ 36 cited

The Aging Effect in Evolving Scientific Citation Networks

Feng Hu, Lin Ma, Xiu-Xiu Zhan +4

The study of citation networks is of interest to the scientific community. However, the underlying mechanism driving individual citation behavior remains imperfectly understood, de…

math.CO2019

Uniformly most reliable three-terminal graph of dense graphs

Sun Xie, Haixing Zhao, Jun Yin

A graph with specified target vertices in vertex set is a -terminal graph. The -terminal reliability is the connection probability of the fixed target vertices in…

math.CO2017★ 4 cited

Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs

Hong Chang, Zhong Huang, Xueliang Li +2

An edge-colored graph is \emph{conflict-free connected} if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The…

math.CO2017★ 2 cited

Conflict-free vertex-connections of graphs

Xueliang Li, Yingying Zhang, Xiaoyu Zhu +2

A path in a vertex-colored graph is called \emph{conflict free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be \emph{conflict-free ve…

math.CO2017★ 1 cited

Conflict-free connection numbers of line graphs

Bo Deng, Wenjing Li, Xueliang Li +2

A path in an edge-colored graph is called \emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph is \emph{conflict-free…

math.CO2015

On the Equitable Vertex Arboricity of Graphs

Yaping Mao, Zhiwei Guo, Hongjian Lai +1

The equitable coloring problem, introduced by Meyer in 1973, has received considerable attention and research. Recently, Wu, Zhang and Li introduced the concept of equitable $(t,k)…

math.CO2015★ 1 cited

On the regular k-independence number of graphs

Zhiwei Guo, Haixing Zhao, Hongjian Lai +1

The \emph{regular independence number}, introduced by Albertson and Boutin in 1990, is the maximum cardinality of an independent set of in which all vertices have equal degree…

physics.soc-ph2014★ 1 cited

Evolution of citation networks with the hypergraph formalism

Feng Hu, Hai-Xing Zhao, Xiu-Xiu Zhan +2

In this paper, we proposed an evolving model via the hypergraph to illustrate the evolution of the citation network. In the evolving model, we consider the mechanism combined with…