中文字幕永久免费视频最新|亚洲尹人九九大色香蕉网站|日本综合另类欧美日韩|亚洲国产欧美另类

1990年在陜西師范大學(xué)獲理學(xué)學(xué)士學(xué)位。1993年在陜西師范大學(xué)獲理學(xué)碩士學(xué)位。2000年于鄭州大學(xué)系統(tǒng)科學(xué)與數(shù)學(xué)系博士研究生畢業(yè)，獲理學(xué)博士學(xué)位。2002年8月于華中科技大學(xué)系統(tǒng)工程博士后流動(dòng)站出站，獲博士后證書。學(xué)士學(xué)位論文：《圖與補(bǔ)圖斷裂度的關(guān)系》，碩士學(xué)位論文：《Cayley 圖》，博士學(xué)位論文：《Some structure problems for matching in graphs》和博士后研究工作報(bào)告:《Some new results of DNA computing and graph theory》。

出版專著2部，在國(guó)內(nèi)外學(xué)術(shù)刊物上發(fā)表學(xué)術(shù)論文150多篇。培養(yǎng)畢業(yè)了36個(gè)碩士研究生，6個(gè)博士研究生（基礎(chǔ)數(shù)學(xué)5個(gè)，系統(tǒng)工程1個(gè)）。2005年作為完成人之一(7(13))獲中華人民共和國(guó)教育部自然科學(xué)一等獎(jiǎng)；2011年作為第一完成人獲山西省科學(xué)技術(shù)三等獎(jiǎng)。

曾經(jīng)擔(dān)任中國(guó)運(yùn)籌學(xué)學(xué)會(huì)理事（2004-2012）?，F(xiàn)任美國(guó)數(shù)學(xué)評(píng)論評(píng)論員，中國(guó)運(yùn)籌學(xué)會(huì)數(shù)學(xué)規(guī)劃分會(huì)理事，中國(guó)運(yùn)籌學(xué)會(huì)圖論組合專業(yè)委員會(huì)委員， 山西省數(shù)學(xué)學(xué)會(huì)常務(wù)理事，山西省工業(yè)與應(yīng)用數(shù)學(xué)學(xué)會(huì)理事。

離散數(shù)學(xué)與理論計(jì)算機(jī)科學(xué)。

近年主持的科研項(xiàng)目：
國(guó)家自然科學(xué)基金項(xiàng)目： 
                          1. DNA計(jì)算在圖論中的應(yīng)用(10471081)(2005.1-2007.12)
                          2. 圖論中NP完全問題的DNA計(jì)算 (60773131)( 2008.01-2008.12
                          3. 網(wǎng)絡(luò)可靠性參數(shù)的優(yōu)化研究（61070229）（2011.01-2013.12）
                          4.教育部博士點(diǎn)基金（博導(dǎo)類）　網(wǎng)絡(luò)連通性優(yōu)化研究(20111401110005)?。?012.01-2014.12）
                          5.互連網(wǎng)絡(luò)容錯(cuò)理論（61370001）?。?014.01-2017.12）

                          山西省自然科學(xué)基金項(xiàng)目: 
                          1. 圖論和DNA計(jì)算中若干新課題(20041002)(2004.1-2006.12)
                          2. 若干NP完全問題的DNA計(jì)算 (2008011010)( 2008.01-2010.12）
                          3. 山西省研究生教育改革研究課題資助項(xiàng)目:交叉學(xué)科研究生教學(xué)的探討(20062003)(2007.01-2009.12)

2016年論文和著作

1. Mujiangshan Wang, Shiying Wang, The 1-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model, International Journal of Computer Mathematics DOI: 10.1080/00207160.2015.1119817(SCI,EI).

2. Ruixia Wang, Shiying Wang. Kings in strong tournaments, Ars Combinatorics 126 (2016) 351-358 (SCI).

3. Mujiangshan Wang, Wenguo Yang, Yubao Guo, Shiying Wang, Conditional Fault Tolerance in a Class of Cayley Graphs, International Journal of Computer Mathematics, 93 (1) (2016) 67-82 (SCI,EI).

4. Mujiangshan Wang, Yuqing Lin; Shiying Wang, The 2-good-neighbor diagnosabilityofCayley graphs generated by transposition trees under the PMC model and MM* model, Theoretical Computer Science 628 (2016) 92-100(SCI, EI,MR).

5. Shiying Wang, Weiping Han, The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM* model, Information Processing Letters 116 (2016) 574–577 , (SCI,EI,MR).

6. 馬曉蕾,王世英,王貞化,交叉立方體的1好鄰連通度和診斷度, Advances in Applied Mathematics 應(yīng)用數(shù)學(xué)進(jìn)展, 2016, 5(3), 282-290.

7. Shiying Wang, Meiyu Wang, Lei Zhang, A sufficient condition for graphs to be super k-restricted edge connected, Discussiones Mathematicae Graph Theory (SCI).

8. Shiying Wang, Zhenhua Wang, Mujiangshan Wang, The 2-extra connectivity and 2-extra diagnosability of bubble-sort star graph networks, The Computer Journal (DOI: 10.1093/comjnl/bxw037).(SCI, EI,英國(guó)計(jì)算機(jī)協(xié)會(huì)的會(huì)刊，澳大利亞的官方期刊標(biāo)準(zhǔn)屬于A*級(jí)別刊物).

9. Mujiangshan Wang, Shiying Wang, Diagnosability of Cayley graph networks generated by transposition trees under the comparison diagnosis model, Annals of Applied Mathematics 32: 2 (2016) 166-173.

2015年論文和著作

1. Shiying Wang, Jing Li, Yuxing Yang, Unchanging the diameter of k-ary n-cube networks with faulty vertices, International Journal of Computer Mathematics 92 (1) (2015) 15-28.(SCI,EI,MR3293021).

2. Kai Feng, Shiying Wang, Strong matching preclusion for two-dimensional torus networks, International Journal of Computer Mathematics 92 (3) (2015) 473-485(SCI,EI,MR3298063).

3. Shiying Wang, Lei Zhang, Shangwei Lin, k-restricted edge connectivity in (p+1)-clique-free graphs, Discrete Applied Mathematics 181 (2015 ) 255-259(SCI,EI,影響因子0.802, MR3284530).

4. Yuxing Yang, Shiying Wang, A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube, Information Sciences 296 (2015) 42–45(SCI,EI, 影響因子4.038,MR3284191).

5. Shiying Wang, Nana, Zhao,Degree Conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected, Discrete Applied Mathematics 184 (2015) 258–263 (SCI,EI,影響因子0.802, MR3320726).

6. 張磊，王世英， 圖是λk－最優(yōu)的和超級(jí)－λk的度條件, 山西大學(xué)學(xué)報(bào)(自然科學(xué)版),2015,38(1): 54-77.

7. 王美玉, 王世英, 圖是極大3限制邊連通的充分條件, 山東科學(xué)，2015, 28(3): 80-83.

8. Kai Feng, Shiying, Guozhen Zhang, Link failure tolerance in the arrangement graphs, International Journal of Foundations of Computer Science 26 ( 2 ) (2015) 241–254 (SCI, EI,MR3343155).

9. Shiying Wang, Kai Feng, Yubao Guo, Sufficient conditions for maximally $k$-isoperimetric edge connectivity of graphs, International Journal of Foundations of Computer Science, 26 (5) (2015) 583–598(SCI, EI,MR3391837).

10. Yuxing Yang, Shiying Wang, Jing Li. Subnetwork preclusion for bubble-sort networks, Information Processing Letters 115 (9) (2015) 817-821(SCI, EI, MR3369014).

11. Yunxia Ren, Shiying Wang, Conditional matching preclusion sets for an mixed-graph of the star graph and the bubble-sort graph, the Lecture Notes in Computer Science series, 9225 (2015) 630-638 (EI).

12. Yunxia Ren, Shiying Wang, Diagnosability of bubble-sort graph networks under the comparison diagnosis model, Proceeding of 2015 International Conference on Computational Intelligence and Communication Networks, pp. 823-826, 2015.

13. Weiping Han,Shiying Wang, The g-Extra Conditional Diagnosability of Folded Hypercubes, Applied Mathematical Sciences, 9 (146) (2015) 7247-7254.

2014年論文和著作

1. Shiying Wang, Kai Feng, Strong matching preclusion for torus networks, Theoretical Computer Science 520 (2014) 97–110(SCI,EI,MR).

2. Shiying Wang, Shurong Zhang, Hamiltonian path embeddings in conditional faulty k-ary n-cubes, Information Sciences, 268 (2014) 463–488 (SCI,EI, 影響因子4.038,MR).

3. Shiying Wang, Kai Feng, Fault tolerance in the arrangement graphs, Theoretical Computer Science, 533 (2014) 64–71 (SCI,EI, MR).

4. Yuxing Yang, Shiying Wang, Jing Li, Conditional connectivity of recursive interconnection networks respect to embedding restriction, Information Sciences 279 (2014) 273–279(SCI,EI, 影響因子4.038, MR).

5. Jing Li, Shiying Wang, Yuxing Yang, Panconnectivity and pancyclicity of the 3-ary n-cube network under the path restrictions. Applied Mathematics and Computation 243 (2014) 339–348(SCI,EI,MR,TOP).

6. Shiying Wang; Lei Zhang, Sufficient conditions for k-restricted edge connected, Theoretical Computer Science 557(2014)66-75(SCI,EI,MR).

7. 任云霞，王世英. 星圖網(wǎng)絡(luò)的定向圖. 河南師范大學(xué)學(xué)報(bào)（自然科學(xué)版），2014, 42(4): 1-5.

8. 王曉麗;王世英, 非極大弧連通有向圖弧連通度的下界, 山東科學(xué), 2014, 27(1): 98-101.

9. (登記) 張淑蓉，王世英，董操, 邊故障k 元n 立方體的超級(jí)哈密頓交織性, 計(jì)算機(jī)工程與應(yīng)用，2014, 50（21）: 39-43.

2013年論文和著作

1. Yuxing Yang, Shiying Wang, Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges, Theoretical Computer Science, 491 (2013) 78–82(SCI,EI Accession number: 20132416420446, MR3062787).

2. Ruixia Wang and Shiying Wang, UNDERLYING GRAPHS OF 3-QUASI-TRANSITIVE DIGRAPHS AND 3-TRANSITIVE DIGRAPHS, Discussiones Mathematicae Graph Theory 33(2) (2013) 429–435.(ISSN:1234-3099,MR3054189).

3. Shurong Zhang, Shiying Wang, Many-to-many disjoint path covers in k-ary n-cubes, Theoretical Computer Science, 491 (2013) 103–118 (SCI,EI Accession number: 20132416420442, MR3062790).

4. Shiying Wang, Jing Li, Shangwei Lin, Ruixia Wang, Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes, Information and Computation,230 (2013) 55–66(SCI,IDS 號(hào): 220TB, EI Accession number: 20133016529359, MR3096361, 中國(guó)計(jì)算機(jī)學(xué)會(huì)推薦國(guó)際學(xué)術(shù)會(huì)議和期刊目錄（2012年）A類 ).

5. Shiying Wang, Kai Feng, Guozhen Zhang, Strong matching preclusion for k-ary n-cubes, Discrete Applied Mathematics, 2013, 61(18) 3054–3062 (SCI,EI Accession number: 20134817020578, MR3126671).

6. Ruixia Wang, Shiying Wang, A sufficient condition for graphs to be λk-optimal, Discrete Applied Mathematics, 2013, 161 (18) 3048–3053 (SCI,EI Accession number: 20122115046375, MR3126670).

7. 張雪飛，王世英，完全偶圖的定向圖, 山東科學(xué), 2013, 26(3): 1-4.

8. 任云霞, 王世英, 成本倒推裝卸工問題. 河南科學(xué)，2013, 31(7): 941-946.

9. 馮凱, 王世英, k元n方體的邊容錯(cuò)性, 山西大學(xué)學(xué)報(bào)（自然科學(xué)版）, 2013, 36 (3): 389-392.

10. 楊玉星, 王世英. k元n立方網(wǎng)絡(luò)的k圈排除問題的遞歸算法, 計(jì)算機(jī)應(yīng)用，2013，33(9)：2401—2403，240.

11. 王牟江山，楊文國(guó)，王世英. 對(duì)稱群上Cayley圖的條件匹配排除數(shù), 應(yīng)用數(shù)學(xué)學(xué)報(bào)(一級(jí)學(xué)科主學(xué)報(bào)) ,2013,36(5): 813-820.

2012年論文和著作

1. Shiying Wang, Yuxing Yang, Fault tolerance in bubble-sort graph networks, Theoretical Computer Science, 2012, 421: 62-69(SCI特二區(qū),EI).

2. Shiying Wang, Kai Feng, Shurong Zhang, Jing Li, Embedding long cycles in faulty k-ary 2-cubes, Applied Mathematics and Computation, 2012, 218 (9): 5409-5413 (SCI EI).

3. Shiying Wang，Lei Zhang，Shangwei Lin，A neighborhood condition for graphs to be maximally k-restricted edge connected, Information Processing Letters, 2012, 112 (3): 95-97(SCI EI).

4. Yuxing Yang, Shiying Wang, Conditional connectivity of star graph networks under embedding restriction, Information Sciences, 2012, 199 (15): 187–192 (SCI特一區(qū)，EI).

5. Shiying Wang，Guozhen Zhang, Kai Feng, Fault tolerance in k-ary n-cube networks, Theoretical Computer Science, 460 (2012) 34–41 (SCI特二區(qū),EI).

6. Shiying Wang, Shurong Zhang, Embeddings of hamiltonian paths in faulty k-ary 2-cubes, Discussiones Mathematicae Graph Theory, 2011, 32(1): 47-61.

7. Yuxing Yang, Shiying Wang, Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges, Theoretical Computer Science, DOI: 10.1016/j.tcs.2012.10.048(SCI特二區(qū) ,EI)

8. 王世英,李晶，楊玉星, 互連網(wǎng)絡(luò)的容錯(cuò)嵌入(專著). 北京：科學(xué)出版社，2012.

2011年文章

1. Shiying Wang, Ruixia Wang, Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc- transitive digraphs, Discrete Mathematics, 2011, 311(4):282-288(SCI,EI)

2. Shangwei Lin, Shiying Wang, Chunfang Li,Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements, Discrete Applied Mathematics, 2011,159 (4): 212-223(SCI特二級(jí)區(qū),EI) 3. Jing Li, Shiying Wang, Di Liu, Pancyclicity of ternary n-cube networks under the conditional fault model,Information Processing Letters, 2011, 111(8): 370-374.(SCI,EI)

4.馮凱,王世英.帶有條件故障邊的k元2方體的圈嵌入.計(jì)算機(jī)工程與應(yīng)用（二級(jí)主學(xué)報(bào)）, 2011

5. Shiying Wang, Shurong Zhang, Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults,Theoretical Computer Science, 2011, 412(46): 6570-6584,(SCI特二區(qū),EI)

6. Jing Li, Shiying Wang, Di Liu, Shangwei Lin, Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges, Information Sciences, 2011, 181 (11): 2260–2267(SCI特一區(qū),EI).

7. Shiying Wang, Jing Li, Ruixia Wang, Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube, Information Sciences 181(14) (2011) 3054-3065(SCI特一區(qū),EI).

8. 王世英，楊玉星，林上為，李晶. 圖的孤立斷裂度. 數(shù)學(xué)學(xué)報(bào), 2011, 54(5) : 861-874(一級(jí)主學(xué)報(bào)）。

9. Shiying Wang, Yuxing Yang, Jing Li, Shangwei Lin, Hamiltonian cycles passing through linear forests in k-ary n-cubes, Discrete Applied Mathematics 2011, 159 (14): 1425-1435 (SCI特二區(qū),EI). 10. Shiying Wang, Guozhen Zhang, Xiuli Wang, Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs, The Australasian Journal of Combinatorics, 50 (2011) 233-242.

11. 楊玉星，王世英．泡形互連網(wǎng)絡(luò)的條件連通性度量．計(jì)算機(jī)工程及其應(yīng)用，2011, 47(22): 13-16.（二級(jí)主學(xué)報(bào)）．

12. 林上為, 李春芳，王世英. 含有兩個(gè)非臨界點(diǎn)的強(qiáng)連通定向圖的弧數(shù). 運(yùn)籌學(xué)學(xué)報(bào)，2011，15(3): 57-61（二級(jí)主學(xué)報(bào)）.

2010年論文

1. Shiying Wang, Shangwei Lin，Path embeddings in faulty 3-ary n-cubes, Information Sciences 180(1)(2010)191-197(SCI特一級(jí)區(qū)IDS Number: 523XK, EI，影響因子3.291).

2. Ruixia Wang, Aimin Yang, Shiying Wang, Kings in locally semicomplete digraphs, Journal of Graph Theory, 2010,63(4):279-287(SCI特二級(jí)區(qū)SCI IDS 號(hào): 567HC ).

3.Shiying Wang, Jing Li, Lihong Wu, Shangwei Lin, Neighborhood conditions for graphs to be super restricted edge connected, Networks,2010,56(1):11-19(SCI特二級(jí)區(qū), IDS 號(hào): 632SH, EI).

4. Shiying Wang, Jing Li, Wei Han, Shangwei Lin, The base sets of primitive zero-symmetric sign pattern matrices with zero trace, Linear Algebra and its Applications, 2010, 433(3): 595-605(SCI特二級(jí)區(qū),IDS 號(hào): 611GT).

5. Shiying Wang, Ruixia Wang, Shangwei Lin, Jing Li, Matching preclusion for k-ary n-cubes, Discrete Applied Mathematics, 158(18) (2010): 2066-2070(SCI特二級(jí)區(qū), EI).

6. 李晶，王世英 . 求二部圖的最大匹配圖的一種算法.電子學(xué)報(bào)（一級(jí)主學(xué)報(bào)）, 2010,38(1):161-166.

7. 張淑蓉，王世英.有故障點(diǎn)的廣義4元n方體中不同長(zhǎng)度的路的嵌入。計(jì)算機(jī)工程與應(yīng)用（二級(jí)主學(xué)報(bào)）2010，46(14):81-83,87.

8. Shiying Wang，Jun Yuan，A degree condition for hamiltonian digraphs，Southeast Asian Bulletin of Mathematics，2010，34(3):523-536.

9. 王世英，任云霞. 網(wǎng)絡(luò)邊連通性的最優(yōu)化.數(shù)學(xué)的實(shí)踐與認(rèn)識(shí), 2010，40(6):145-150.

10. Jiangshan Wangmu , Jun Yuan, Shangwei Lin, Shiying Wang, Ordered and Ordered Hamilton Digraphs, Chinese Quarterly Journal of Mathematics, 2010, 25 (3): 317-326.

2009年論文和著作

1. 王世英, 林上為. 網(wǎng)絡(luò)連通性的最優(yōu)化(專著).北京:科學(xué)出版社,2009.

2. Shangwei Lin, Shiying Wang, Super p-Restricted Edge Connectivity of Line Graphs, Information Science, 179 (2009) 3122–3126 (SCI特一級(jí)區(qū), IDS Number: 479HA EI),

3. Shiying Wang, Shangwei Lin，The k-restricted edge connectivity of undirected Kautz graphs, Discrete Mathematics,2009,309(13):4649-4652(SCI, EI).

4. Shiying Wang, Ruixia Wang, The structure of strong arc-locally in-semicomplete digraphs, Discrete Mathematics,(SCI, EI) .

5.黃學(xué)臻, 林上為, 王世英. 一類無向Kautz圖的k限制邊連通度的上界,應(yīng)用數(shù)學(xué)學(xué)報(bào)（一級(jí)主學(xué)報(bào)）,2009, 269-276.

6. 王世英.交叉學(xué)科研究生教學(xué)的探討, 山西財(cái)經(jīng)大學(xué)學(xué)報(bào)(高等教育版)，2009，12(1):42-45 .

7. Guozhi Zhang, Shiying Wang, Matrix Multiplication Based on DNA Computing, The 5th International Conference on Natural Computation and the 6th International Conference on Fuzzy Systems and Knowledge Discovery(EI, ISTP)

2008年論文

1. Shiying Wang(王世英), Jun Yuan, Aixia Liu, k-Restricted edge connectivity for some interconnection networks, Applied Mathematics and Computation, 2008,201(1-2):587-596. (SCI IDS Number:312HQ, EI).

2. Shiying Wang(王世英), Shangwei Lin, Sufficient conditions for a graph to be super restricted edge-connected, Networks, 2008, 51(3):200-209.(SCI IDS Number: 300WF, EI: Accession number:083811547410)

3. WANG Shiying(王世英), YUAN Jun LIN, Shangwei, DNA Labelled Graphs with DNA Computing, Science in China, Series A: Mathematics, 2008,51(3):437-452( SCI: IDS Number: 258SK).

4. Shiying Wang(王世英), Shangwei Lin, Chunfang Li, Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2, Discrete Mathematics, 2009，309(4)：908-919(SCI,EI) 5. 原軍，王世英，劉愛霞. 一些DNA圖的標(biāo)號(hào). 中北大學(xué)學(xué)報(bào)，2008，29(1): 4-7.

6. Wang Shi-Ying(王世英), Lin Shang-Wei, Li Chun-Fang, A Sufficient Condition for -Optimal Graphs, Intelligent Information Management Systems and Technologies , 2008, 4(1) : 23-34.

7. 王世英, 郭繼文, 一類(k+1)-色有向圖的本原指數(shù), 應(yīng)用數(shù)學(xué), 2008, 21(4):778-786.

8. 林上為，王世英，李春芳. $/lambda_k$最優(yōu)圖的充分條件, 數(shù)學(xué)認(rèn)識(shí)與實(shí)踐, 2008,38(12):208-213.

9. Shiying Wang(王世英),Shangwei Lin, $/lambda'$-optimal digraphs, Information Processing Letters, 2008,108 (6) 386-389(SCI IDS Number: 370IG, EI) .

10. Shiying Wang(王世英), Jun Yuan, Aixia Liu, Sufficient conditions for super-arc-strongly connected oriented graphs, Graphs and Combinatorics, 2008, 24(6):587-595(SCI IDS Number: 378RP).

11. Jun Yuan, Aixia Liu, Shiying Wang(王世英), Sufficient Conditions for Bipartite Graphs to Be Super k-Restricted Edge Connected, Discrete Mathematics, 2009,309(9):2886-2896(SCI,EI).