Zhejiang Normal University

output

20052015

most citedGeneration of pure bulk valley current in graphene

257 citations

Showing 2012 · math.COShow all

2 papers · 2 filters

math.CO2012

Circular flow number of highly edge connected signed graphs

Xuding Zhu

This paper proves that for any positive integer $k$ , every essentially $(2 k + 1)$ -unbalanced $(12 k - 1)$ -edge connected signed graph has circular flow number at most $2 + \frac{1}{k}$ .

math.CO2012★ 2 cited

Ascent sequences and 3-nonnesting set partitions

Sherry H. F. Yan

A sequence x=x_1 x_2...x_n $i ss ai d t o b e ana sce n t se q u e n ceo f l e n g t h$ n $i f i t s a t i s f i es x_{1} = 0 an d$ 0\leq x_i\leq asc(x_1x_2...x_{i-1})+1 $f or a l l$ 2\leq i\leq n $, w h er e$ asc(x_…