Skip to content Skip to navigation

Faculty

Zhiren Sun Professor

Bio: 

Educational Background

  • PhD, Operations research and control theory, Institute of systems science, Chinese academy of sciences (1998)
  • MA, Fundamental mathematics, Nanjing Normal University (1988)
  • BA, Fundamental mathematics, Nanjing Normal University (1985)

 

Professional Experiences

  • Vice dean, The graduate school of Nanjing Normal University(NNU), 2013.5--
  • Secretary of the party committee, School of computer science and technology of NNU,2009.4---2014.5
  • Vice dean, School of mathematics and computer science of NNU,2002.2—2009.4
  • Professor, Department of Mathematics of NNU,2006.5--
  • Associate professor, Department of Mathematics of NNU,1995.5—2006.5
  • Lecture, Department of Mathematics of NNU,1988.9—1995.5

 

Research

Research Interests

Graph theory and combinatorial optimization

 

Research Projects

Distance parameters and some related extremum problems, NSFC(Natural Science Foundation of China) (11571135). 201601-201912.

Random approximation algorithm research on information science and hypergraph partitioning, NSFC(Natural Science Foundation of China) (11471003). 201501-201812.

Some studies on the existence of spanning subgraphs, NSFC(Natural Science Foundation of China) (11371009).201401-201712.

 

Journal Articles

  1. Isolated toughness and k-Hamiltonian [a,b]-factors,Acta Mathematicate Applicatae Sinica,English Series,Accept.
  2. Binding numbers for all fractional (a,b,k)-critical graphs, Filomat 28(4)(2014),709-713,(with ZHOU Sizhong,BIAN Qiuxiang).
  3. On all fractional (a,b,k)-critical graphs,Acta Mathematica Sinica, English Series, 30(40)(2014),696-702,(with ZHOU Sizhong).
  4. Remarks on neighborhoods of independent sets and (a,b,k)-critical graphs,J. Appl. Math. & Informatics, 31(5,6)(2013),669-676,(with ZHOU Sizhong, XU Lan)
  5. A toughness condition for fractional (k,m)-deleted graphs, Information Processing Letters,113(2013),255-259, (with ZHOU Sizhong, YE Hui)
  6. A minimum degree condition for fractional id-[a,b]-fractor-critical graphs, Bull. Aust. Math. Soc.,86(2012), 177-183, (with ZHOU Sizhong,LIU Hongxia)
  7. Independent number and minimum degree for fractional id-f-factor-critical graphs, Aequat. Math., 84(2012),71-76,(with ZHOU Sizhong,XU Lan).
  8. SECA:Snapshot-based Event Detection for Checking Asynchronous Context Consistency in Ubiquitous Computing,IEEE WCNC 2012,April,2012,Paris,France.(with ZHANG Daqiang,ZOU Qin,JO Minho,JI Genlin)
  9. Isomorphism of transformation graph, J.East China Norm. Univ.,Nat.Sci.Ed.6(2010),142-145(with GU Xiusong,XU Dandan,YAO Zeqing)
  10. Some results on graph products determined by their spectre, J. Math. Res. Expo.30(2)(2010),227-232(with XU Kexiang,YAN Juan,XU Baogang)
  11. The transformation graph Gxyz when xyz=--+, Journal of Nanjing Normal University(natural science edition) 32(3)(2009)(with GU Xiusong,ZHANG,Jie)
  12. A sufficient condition for a quasi claw-free graph to be Pacyclic,Journal of Nanjing Normal University(natural science edition)32(1)(2009),22-34(with ZHANG Jie)
  13. On 3-choosability of planar graphs without certain cycles, Inform. Process. Lett.107(2008),no.3-4,102-106(with ZHANG Haihui)
  14. Image encryption scheme based on orderly cellular automata, Optical precision engineering,Vol.16 No.9(2008)1781-1786(with ZHANG Xiaoyan, WANG Chao, YU Yang)
  15. A new image encryption scheme based on two-dimensional CA joint with CWQ method, Journal of Nanjing Normal University(natural science edition) 31(2008),no.1,1-7(with ZHANG Xiaoyan, WANG Chao,ZHANG Zanbo)
  16. A bound for the quasi-Laplacian spectral radius of connected graphs, Journal of Nanjing Normal University(natural science edition)  31(2008),no.2,27-30(with ZHU Xiaoxin,CAO  Chunzheng)
  17. Minimum diameter orientations of Km v Kn, Chinese Quart. J. Math.22 (2007), No.3,359-363(with MIAO Xiaoyan)
  18. Long dominating cycle in graphs,Int.J.Math.Comb.1(2007),no.1,94-109(with A Yongga)
  19. Every plane graph with girth at least 4 without 8- and 9-circuits is 3 choosable, Ars Combinatoria, 80(2006),247-257(with ZHANG Haihui, Xu Baogang)
  20. A sufficient condition of pancyclic graphs, Journal of Nanjing Normal University(natural science edition),29(2)(2006),31-34(with WU Wei, QI Zhiru, YUAN Xiuhua)
  21. Pancyclicity Mod k of K_(1,4)-free Graphs, Advances In Mathematics(CHINA) Advances in Mathematics,34(02)(2005),221-232(with A Yong-ga,TIAN Feng, WEI bing)
  22. Disjoint quasi-kernels in digraphs,Journal of Nanjing Normal University(natural science edition),28(3)(2005),11-14(with MIAO Xiaoyan)
  23. Four Cycle Cover of bipartite graphs,Journal of jiangsu university of science and technology (natural science edition),19(6)(2005),36-40(with BIAN Qiuxiang)
  24. Circumferences of Claw-Free Graphs, Journal of guangxi normal university (natural science edition),23(4)(2005),37-41(with CHEN Hong,WU Zhengsheng)
  25. The Cycles throught a specified vertex in weighted graphs,Journal of hohai university (natural science edition),33(6)(2005),721-724(with BIAN Qiuxiang)
  26. Pancyclicity mod k of K1,4-free graphs,Advances in Mathematics,34(2)(2005),221-232(with A Yongga,Tian Feng, Wei Bing)
  27. A lower bound of the circumference in claw-free graphs,Journal of guangxi normal university (natural science edition),22(2)(2005),28-34(with CHNE Hong,WU Zhengsheng)
  28. The game coloring and game coloring number in graphs, Journal of Huaiyin Teachers College4(2)(2005),94-97(with QI Zhiru)
  29. Graph design for 6 vertices and 7 edges graphs, Journal of Yangzhou University (natural science edition),8(1)(2005),9-13(with XU Aiqing)
  30. Large cycles passing through a specified edge in 2-connected graphs,Journal of Nanjing Normal University(natural science edition),26(2) (2003), 10--14(with Bian Qiuxiang)
  31. Partition of graphs into cycles and paths,Journal of Nanjing Normal University(natural science edition),26(2)(2003),, 6-9(with CHEN Lijuan,BIAN Qiuxiang)
  32. Long cycles passing through a specified edge in 3-connected graphs,Graphs and Combinatorics, 17(2001), 565-577(Sun Zhiren,Tian Feng, Wei Bing)
  33. Degrees sum, connectivity and dominating cycles in graphs, Graphs and Combinatorics,17(2001), 555-564(Sun Zhiren,Tian Feng, Wei Bing)
  34. Circumferences of claw-free graphs, Systems Science and Mathematical Sciences, 13(2000), 225(Sun Zhiren, Wu Zhengsheng)
  35. A Bondy and Fan's problem on weighted graphs, Journal of Nanjing Normal University(Natural Science), 1(1)(1999), 4-6(with WU Zhengsheng, ZHANG Xuerong)
  36. Degree sum,Connectivity and dominating cycle in graphs, Chinese Science Bulletin, 43(1998), 445(with TIAN Feng,WEI Bing)
  37. Long dominating cycles in graphs, Systems Science and Mathematical Sciences, 11(1998) 230-237.
  38. Hamiltonicity in 2-connected graphs with claws, Discrete Math. 183(1998), 223-236(with LI Hao,LU Mei)
  39. Hamiltonicity and neighbor intersections in triangle-free graphs, in : Advances in Operations Research and Systems Engineering, J.Gu et al eds. Global-link Informatics Ltd.,Hongkong 1998, 104-113(孙志人)
  40. S-D-cycles and S-D-paths passing through a specific vertex set, Journal of Nanjing Normal University(Natural Science),20(1)(1997), 10-15(with ZHENG Sujuan)
  41. A sufficient condition for S-dominating cycles, Journal of Nanjing Normal University(Natural Science),18(3)(1995),10-12(with XU Xinping)
  42. Paths through a specific subgraph in claw-free graphs, Journal of Nanjing Normal University(Natural Science),18(1)(1995),35-40
  43. Longest u-path in k-connectivity claw-free graphs,Journal of Nanjing Normal University(Natural Science),13(1)(1990),7-15
  44. Longest path in (k-1)-connectivity claw-free graphs,Journal of Nanjing Normal University(Natural Science),(1)(1988),15-29.

 

Honors and Awards

  • The scholarship of the Chinese academy of sciences, China,1998.
  • Award for the excellent party member of NNU, 2005
  • Award for the prominent teacher of NNU, 2007
  • Award for the best management of NNU, 2009
  • Teaching and education award of NNU, 2009

 

Contact

+86-25-85891928

zrsun@njnu.edu.cn