|
个人信息Personal Information
副教授
博士生导师
硕士生导师
性别：女
毕业院校：大连理工大学
学位：博士
所在单位：计算机科学与技术学院
学科：计算机软件与理论
联系方式：0411-84706009-3913
电子邮箱：xirongxu@dlut.edu.cn
扫描关注
- [81]Xu, Xirong, Jun-Ming, Lue, Min, Zhang Baosheng, Nan, Cao, XR (reprint author), Dalian Univ Technol, Dept Comp Sci, Dalian 116024, Peoples R China..On (a, d)-Antimagic Labelings of Generalized Petersen Graphs[J],ARS COMBINATORIA,2009,90:411-421
- [82]Xueliang F., Xu X., Yuansheng Y., Feng X., Xu, X., Department of Computer Science, Dalian University of Technology, Dalian, 116024, China, email: xirongxu@dlut.edu.cn.On the domination number of Kn?del graph W3,n[J],International Journal of Pure and Applied Mathematics,2009,50(4):553-558
- [83]Xu Xirong, Yang Yuansheng, Li Huijun, Xi Yue, Xu, XR (reprint author), Dalian Univ Technol, Dept Comp Sci, Dalian 116024, Peoples R China..The graphs C(11)((t)) are graceful for t equivalent to 0, 1 (mod 4)[J],ARS COMBINATORIA,2008,88:429-435
- [84]徐喜荣.On the Harmoniousness of the Gear Graph[J],Journal of systems science and information,2008,3:353-359
- [85]徐喜荣.On the gracefulness of the digraphs n-Cm for m Odd[J],Journal of Prime Research in Mathematics,2008,4:118-126
- [86]徐喜荣, 杨元生, 奚悦.The graphs C11t are graceful for t≡0,1 mod 4[J],Ars Combinatoria,2008,88:429-435
- [87]Xu Xirong, Yang Yuansheng, Xi Yue, Li Huijun, Xu, X (reprint author), Dalian Univ Technol, Dept Comp Sci, Dalian 116024, Peoples R China..On (a,d)-antimagic labelings of generalized Petersen graphs P(n,3)[J],ARS COMBINATORIA,2008,86:23-31
- [88]Yang Yuansheng, Xu Xirong, Xi Yue, Li Huijun, Yang, YS (reprint author), Dalian Univ Technol, Dept Comp Sci, Dalian 116024, Peoples R China..The Graphs C-9((t)) are graceful for t=0, 3 (mod 4)[J],ARS COMBINATORIA,2007,85:361-368
- [89]徐喜荣, 周建钦, 汪光阳, Xu, X.-R.(xirongxu@ustc.edu.cn).关于非单位步长的紧优双环网络G(N;r,s)[J],大连理工大学学报,2007,47(2):305-312
- [90]徐喜荣, 周建钦, 汪光阳.On infinite family of Tight Double Loop Networks[J],Acta Mathematicae Applicatae Sinica,2007,30:129-137
- [91]杨元生, 徐喜荣, 奚悦.The graphs C7t are graceful for t≡0,1mod 4[J],Ars Combinatoria,2006,79:295-301