当前位置: X-MOL首页全球导师 国内导师 › 刘爱霞

个人简介

1998.09—2002.07 太原师范学院数学系数学教育专业学习,获理学学士学位 2003.09—2006.07 山西大学数学科学学院应用数学专业学习,获理学硕士学位 2006.08—2008.07 山西大学商务学院教师 2008.08—至今 太原科技大学应用科学学院数学系教师

研究领域

组合图论

近期论文

查看导师最新文章 (温馨提示:请注意重名现象,建议点开原文通过作者单位确认)

1.Aixia Liu,Shiying Wang,Jun Yuan, On g-extra conditional diagnosability of hypercubes and folded hypercubes, Theoretical Computer Science 704 (2017) 62–73.(SCI收录) 2.原军,刘爱霞,局部内(外)半完全有向图可迹的充分条件,应用数学学报,2016,39(2):200-212.(一级学科主学报) 3. Jun Yuan,Aixia Liu, et. al.Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected, Information Processing Letters 116(2016)163–167.(SCI收录) 4. Yun Yuan,Aixia Liu,et. al.g-Good-neighbor conditional diagnosability measures for 3-ary n-cube networks,Theoretical Computer Science, 626 (2016) 144–162.(SCI收录) 5.Yun Yuan,Aixia Liu, Jifu Zhang et. al.The good-neighbor conditional diagnosability of k-Ary n-cubes under the PMC model and MM* model.IEEE Transaction on Parallel and Distributed systems, 26(2015):1165-1177.(SCI收录) 6.刘爱霞,原军,λ’-最优无三角图的最小边度充分条件,太原科技大学学报,2014,35(4):318-322. 7. Jun Yuan, Aixia Liu, et. al. Panconnectivity of n-dimensional torus networks with faulty vertices and edges. Discrete Applied Mathematics 161 (2013) 404–423.(SCI收录) 8.刘爱霞,原军,超级限制边连通二部图的充分条件,应用数学学报,2013,36(2):209-216.(一级学科主学报) 9.刘爱霞,原军,扩张竞赛图中的泛连通性点对,太原科技大学学报,2013,34(4):317-321. 10.Jun Yuan, Aixia Liu.The k-Restricted Edge Connectivity of Balanced Bipartite Graphs.Graphs and Combinatorics (2011) 27:289–303.(SCI收录) 11.Jun Yuan,Aixia Liu. Sufficient conditions for lammd_k-optimality in triangle-free graphs.Discrete Mathematics 310 (2010) 981-987.(SCI收录) 12.Jun Yuan,Aixia Liu,Shiying Wang.Sufficient conditions for bipartite graphs to be super-k-restricted edge connected.Discrete Mathematics 309 (2009) 2886-2896.(SCI收录) 13.Shiying Wang,Jun Yuan,Aixia Liu.k-Restricted edge connectivity for some interconnection networks, Applied Mathematics and Computation 201 (2008) 587–596.(SCI收录) 14.刘爱霞,杨爱民,扩张的局部内(外)半完全有向图的可迹性,中北大学学报,2008,29(5):395-398.

推荐链接
down
wechat
bug