¡¾»ù±¾ÇéÐΡ¿
ÇØÓ¨Ó¨£¬£¬Å®£¬£¬Ë¶Ê¿£¬£¬¸±½ÌÊÚ¡£¡£¡£¡£¹¥¶Á˶ʿѧλʱ´ú£¬£¬ËùѧµÄרҵÊÇ´úÊýͼÂÛ¡£¡£¡£¡£ÊÂÇéºóÒ»Ö±´ÓÊÂͼµÄÌõ¼þÁ¬Í¨ÐÔÀíÂÛ¼°ÆäÓ¦ÓõÄÑо¿¡£¡£¡£¡£1999.9-2002.7 ¾Í¶ÁÓÚÂåÑôʦ·¶×¨¿ÆÑ§Ð££¬£¬2002.9-2004.7 ¾Í¶ÁÓÚÐÅÑôʦ·¶Ñ§Ôº»ñÀíѧѧʿѧ룬£¬2004.9-2007.6 ¾Í¶ÁÓÚÀ¼ÖÝ´óѧ»ñÀíѧ˶ʿѧ룬£¬2007.7ÖÁ½ñÔÚÒ¼ºÅÓéÀÖAPPÊýÀíϵÈν̣¬£¬Ö÷Òª³Ðµ±¹«¹²Êýѧ¼°Ó¦ÓÃÊýѧµÄÊÚ¿ÎʹÃü¡£¡£¡£¡£
¡¾Ö÷Êڿγ̡¿¡¶¸ßµÈÊýѧ¡·¡¶ÏßÐÔ´úÊý¡·¡¶Í¼ÂÛ¼°ÆäÓ¦Óá·¡¶¸ÅÂÊÂÛ¡·µÈ¡£¡£¡£¡£
¡¾Ö÷Òª¿ÆÑÐЧ¹û¡¿
[1] Yingying Qin, Jianping Ou, Zhiping Xiong, On 3-restricted edge connectivity of Cartesian product graphs, Ars Combin, 103, 233-238, 2012. (SCI)
[2] Yingying Qin*, Jianping Ou,Sufficient conditions for maximally restricted edge connected graphs, Discrete Math., 312, 2969-2972,2012. (SCI)
[3] Yingying Qin*, Jianping Ou, Zhiping Xiong, On equality of restricted edge connectivity and minimum edge degree of graphs, Ars Combin, ½ÓÊÜ´ý½ÒÏþ. (SCI)
[4] Luo Yanfeng*, Zhang Wenting, Qin Yingying, Hou Hailong, Split graphs whose half-strong endomorphisms form a monoid, Science of China (Öйú¿ÆÑ§), 55, 1099-1320, 2012. (SCI)
[5] Yingying Qing*, Jianping Ou, On restricted edge connectivity of Cartesian product graphs, Int. J. Appl. Math. Stat., 37, 65-70, 2013. (EI)
[6] Yingying Qin*, Jianping Ou, Zhiping Xiong, On super 3-restricted edge connectivity
of regular strong product graphs with girth at least four, 2012 International
conference on networking and digital society, 1,542-544,2010. (EI)