Yang Yuansheng - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2014

Feedback Number of Generalized Kautz Digraphs GK(2, n)Lei Wang, Xirong Xu, Yang Yuansheng, Di Ming, Dong Xuezhi. arscom, 116:147-160, 2014.

2013

3, nKh. Md. Mominul Haque, Lin Xiaohui, Yang Yuansheng, Zhao Pingzhong. arscom, 109:113-128, 2013.

2012

Hamiltonian Properties of the 3-(γ, 2)-Critical GraphsZhao Chengye, Yang Yuansheng, Sun Linlin. arscom, 107:177-192, 2012.

On the Packing Number of Generalized Petersen Graphs P(n, 2)Yang Yuansheng, Xueliang Fu, Baoqi Jiang. arscom, 104:23-32, 2012.

2011

The Connected Domination and Tree Domination of P(n, k) for k = 1, 2, [n/2]Zhao Chengye, Yang Yuansheng, Sun Linlin, Feilong Cao. arscom, 101:467-479, 2011.

2009

The Connected and Tree Domination Number of P(n, k) for k = 4, 6, 8Zhao Chengye, Yang Yuansheng, Shi Lei, Sun Linlin. arscom, 92, 2009.

13 are Graceful for t = 0, 3 (mod 4)Xirong Xu, Yang Yuansheng, Lizhong Han, Li Huijun. arscom, 90, 2009.

2008

Domination dot-critical graphs with no critical verticesZhao Chengye, Yang Yuansheng, Sun Linlin. DM, 308(15):3241-3248, 2008. [doi]

On the crossing numbers of K::m::square C::n:: and K::m, l::square P::n::Zheng Wenping, Lin Xiaohui, Yang Yuansheng, Deng Chengrui. DAM, 156(10):1892-1907, 2008. [doi]

The Graphs C(t)11 are Graceful for t = 0, 1 (mod 4)Xu Xirong, Yang Yuansheng, Li Huijun, Xi Yue. arscom, 88, 2008.

The planar Ramsey number ::::I::::Sun Yongqi, Yang Yuansheng, Lin Xiaohui, Song Yanan. DM, 308(23):5841-5848, 2008. [doi]

One edge union of k shell graphs is cordialXi Yue, Yang Yuansheng, Wang Liping. arscom, 86, 2008.

Super Vertex-magic Total Labelings of W3, nXi Yue, Yang Yuansheng, Mominul, Wang Liping. arscom, 86, 2008.

2007

2006

New Lower Bounds on the Multicolor Ramsey Numbers ::::R::::::::::r::::::(::::C::::::2::::::::m::::::)Sun Yongqi, Yang Yuansheng, Xu Feng, Li Bingxi. gc, 22(2):283-288, 2006. [doi]

The face pair of planar graphsYang Yuansheng, Lin Xiaohui, Qiao Jing. DM, 306(15):1742-1757, 2006. [doi]

The Graphs C(t)7 are Graceful for t = 0, 1, (mod 4)Yang Yuansheng, Xu Xirong, Xi Yue, Li Huijun, Khandoker Mohammed Moninul Hacque. arscom, 79, 2006.

2005

Some 3-connected 4-edge-critical non-Hamiltonian graphsYang Yuansheng, Zhao Chengye, Lin Xiaohui, Jiang Yongsong, Hao Xin. jgt, 50(4):316-320, 2005. [doi]

On Harmonious Labelings of the Balanced Quadruple ShellsYang Yuansheng, Xu Xirong, Xi Yue, Qiao Jing. arscom, 75, 2005.

The Graphs C(t)5 are Graceful for t = 0, 3 (mod 4)Yang Yuansheng, Lin Xiaohui, Chunyan Yu. arscom, 74, 2005.

2004

Maximizing Battery Life Routing in Wireless Ad Hoc NetworksWeifa Liang, Yang Yuansheng. hicss 2004: [doi]

The crossing number of ::::C::::(::::n::::; 1, 3 )Yang Yuansheng, Lin Xiaohui, Lu Jianguo, Hao Xin. DM, 289(1-3):107-118, 2004. [doi]

2003

The minimum number of vertices with girth 6 and degree set ::::D::::={::::r, m::::}Yang Yuansheng, Weifa Liang. DM, 269(1-3):249-258, 2003. [doi]

1997

On Smallest Maximally Nonhamiltonian GraphsLin Xiaohui, Jiang Wenzhou, Chengxue Zhang, Yang Yuansheng. arscom, 45, 1997.

1995

e)Yang Yuansheng, G. R. T. Hendry. jgt, 19(1):13-15, 1995. [doi]

Sign in or sign up to see more results.

runs on WebDSL