Anhui University of Finance and Economics

output

20122026

most citedTracing magnetic fields by the synergies of synchrotron emission gradients

18 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

Fei Li2 profiles8 · h 9
Kai Wang4 · h 12
Yanling Zhu4 · h 10
Xiumei Li2 profiles3 · h 4
Zheng-Jiang Xia3 · h 4
Fuyuan Chen2 · h 4
Qiuyan Wang2 profiles2 · h 10
Yong Ren2 · h 32
Zhen-Mu Hong2 · h 4
A. Elazab1 · h 10
A. Lazarian1 · h 66
Baozhu Feng1 · h 2

collaborating institutions

Qufu Normal UniversityCN3 papers
Tsinghua UniversityCN3 papers
Anhui Normal UniversityCN2 papers
Anhui Science and Technology UniversityCN2 papers
Anhui University of Science and TechnologyCN2 papers
Institute of Information EngineeringCN2 papers
Beijing Institute of TechnologyCN1 paper
Beijing Normal UniversityCN1 paper
Beijing PlanetariumCN1 paper
China University of Petroleum, East ChinaCN1 paper
Chinese Academy of SciencesCN1 paper
Chinese University of Hong Kong, ShenzhenCN1 paper

Showing 2017 · math.COShow all

2 papers · 2 filters

math.CO2017★ 2 cited

Sufficient conditions for graphs to be $k$ -connected, maximally connected and super-connected

Zhen-Mu Hong, Zheng-Jiang Xia, Fuyuan Chen +1

Let $G$ be a connected graph with minimum degree $δ (G)$ and vertex-connectivity $κ (G)$ . The graph $G$ is $k$ -connected if $κ (G) \geq k$ , maximally connected if $κ (G) = δ (G)$ , and su…

math.CO2017★ 1 cited

Pebbling on Jahangir graphs

Zheng-Jiang Xia, Zhen-Mu Hong, Fu-Yuan Chen

The pebbling number of a graph $G$ , $f (G)$ , is the least $p$ such that, however $p$ pebbles are placed on the vertices of $G$ , we can move a pebble to any vertex by a sequence of m…

Sufficient conditions for graphs to be k-connected, maximally connected and super-connected

Pebbling on Jahangir graphs

Sufficient conditions for graphs to be $k$ -connected, maximally connected and super-connected