1. Wang Shiying, Yang Yuxing, Fault Tolerance in Bubble Sorting Graph Network, Theoretical Computer Science, 2012,421:62-69 (SCI Special Zone Report II, EI).
2. Feng Kai,, Zhang,, Embedding Long Circle in Wrong K-ary 2- Cube, Applied Mathematics and Calculation, 2012,218 (9): 5409-5413 (SCEI).
3. A Neighborhood Condition of Maximum K Restricted Edge Connectivity of Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin, Lin
4. Yang Yuxing, Wang Shiying, Conditional Connectivity of Star Map Network with Embedding Constraints, Information Science, 20 12, 1 99 (15):187-192 (SCI Special Zone Daily/kloc-0.
5. Wang Shiying, Feng Kai, Fault Tolerance of K-ary N- cube Networks, Theoretical Computer Science, 460(20 12)34-4 1.
6. Embedding of Zhang,, Hamilton Road in Wrong K-ary 2- Cube, Mathematical Graph Theory, 20 1 1, 32( 1): 47-6 1.
7. Yang Yuxing, Wang Shiying, Fault-free Hamiltonian cycle passes through linear forest in ternary n- cube with fault edges, theoretical computer science, doi:10.16/j.tcs.2012./kloc-0.
8. Wang Shiying, Li Jing, Yang Yuxing, Network Fault-tolerant Embedding (Monograph). Beijing: Science Press, 20 12.
Articles published in 20 1 1 year
1. Wang Shiying, Wang Ruixia, Independent Sets and Non-augmented Paths in Arc Locally Incomplete Directed Graphs and Quasi-arc Transitive Directed Graphs, Discrete Mathematics, 201,311(4): 282-288 (sci
2. Pan-connectivity and edge pan-cyclicity of K-ary n- cubes with deficient elements, Discrete Applied Mathematics, 20 1 1,159 (4): 212-223 (sci special secondary area, EI) 3. 20 1 1， 1 1 1(8):370-374。 (SCI，EI)
4. Feng Kai, Wang Shiying. Circular Embedding of K-ary 2- Cubes with Conditional Misalignment. Computer Engineering and Application (Journal II), 20 1 1.
5. Zhang, embedding Hamiltonian path in K-ary n- cube with conditional edge dislocation, Theoretical Computer Science, 20 1 1, 4 12 (46): 6570-6584, (SCI Special Zone 2)
6.,,,, Lin, Edge-Bicyclicity of K-ary n- cube with wrong nodes and wrong edges, Information Science, 201,181(11): 20.
7. Wang Shiying, Jing Li, Wang Ruixia, 3 yuan Hamiltonian paths and cycles with specified edges in n- cubes, Information Science181(14) (2011) 3054-.
8. Wang Shiying, Lin, Li Jing. Isolated fracture degree of graphs. Journal of Mathematics, 20 1 1, 54 (5): 86 1-874 (first-class main journal).
9.,,,, forest, Hamilton circle passes through the k-ary N cube of linear forest, and discrete applied mathematics 20 1 1,159 (14):1425-1435. Wang Xiuli, Sufficient Conditions for Maximum Edge Connected Graphs and Arc Connected Graphs, Australian Journal of Combinatorics, 50 (20 1 1) 233-242.
1 1. Yang Yuxing, Wang Shiying. Conditional connectivity measurement of bubble interconnection networks. Computer engineering and its application, 201,47 (22): 13- 16. (secondary main periodical).
12. Lin, Wang Shiying. The number of arcs of strongly connected digraphs with two non-critical points. Journal of Operational Research, 20 1 1, 15 (3): 57-6 1 (secondary main issue).
20 10 paper
1. Lin, Path Embedding in 3-aryn Cube, Information Science180 (1) (2010)191-65438+.
2. Wang Ruixia, Yang Aimin, Wang Shiying, Wang in locally semi-complete directed graphs, Journal of Graph Theory, 20 10/0,63 (4): 279-287 (sci IDS NO. :567HC)。
3. Neighborhood conditions of super-restricted edge connectivity of,,, forest, graph, network, 20 10/0,56 (1):1-19. :632SH，EI)。
4. Basis set of primitive zero symmetric symbolic pattern matrix with zero trace, linear algebra and its application, 20 10/0,433 (3): 595-605. :6 1 1GT)。
5. Matching exclusion of K-ary n- cubes, Discrete Applied Mathematics,158 (18) (2010): 2066-2070 (2007).
6. Li Jing, Wang Shiying. An algorithm for finding the maximum matching graph of bipartite graphs. Journal of Electronic Science (first-class main issue), 20 10/0,38 (1):161-166.
7. Zhang, Wang Shiying. Embedding roads with different lengths in generalized 4 yuan n-cube with fault points. Computer Engineering and Application (Journal of Secondary Trunk) 20 10/0,46 (14): 81-83,87.
8. Yuan Jun Wang Shiying, A Degree Condition of Hamiltonian Directed Graph, Bulletin of Southeast Asian Mathematics, 20 10/0,34 (3): 523-536.
9. Wang Shiying, Ren. Optimization of network edge connectivity. Practice and Understanding of Mathematics, 20 10/0,40 (6):145-150.
10. Jiangshan,,, Lin,, Ordered and Ordered hamiltonian graph, Mathematics Quarterly, 20 10/0,25 (3): 317-326.
Papers and works in 2009
1. Wang Shiying, Lin,. Optimization of network connectivity (monograph). Beijing: Science Press, 2009.
2. Super-P- Restricted Edge Connectivity of Lin,, Information Science,179 (2009) 3122–3126 (SCI-I area, IDS number: 479HA EI),
3. k- restricted edge connectivity of undirected graphs, discrete mathematics, 2009,309 (13): 4649-4652 (sci, ei).
4. Wang Shiying, Wang Ruixia, Structure of Strong Arc Locally Incomplete Directed Graphs, Discrete Mathematics.
5. Huang, Lin and Wang Shiying. Upper bound of k-restricted edge connectivity of a class of undirected graphs, Journal of Applied Mathematics (first-class main issue), 2009, 269-276.
6. Wang Shiying. Discussion on interdisciplinary postgraduate teaching, Journal of Shanxi University of Finance and Economics (Higher Education Edition), 2009, 12 (1): 42-45.
7. Zhang Guozhi, Wang Shiying, Matrix Multiplication Based on DNA Computing, 5th International Conference on Natural Computing and 6th International Conference on Fuzzy Systems and Knowledge Discovery (EI, ISTP).
Papers in 2008
1. (Wang Shiying),,, Liu, K- restricted edge connectivity of some interconnected networks, applied mathematics and calculation, 2008,201(1-2): 587-596. (SCIDS number: 31.
2. (Wang Shiying), Lin, the formal conditions for a graph to become a super-restricted edge connected graph, Network, 2008,51(3): 200-209. (SCIDSNo.: 300WF, EI: AccessNo.:)
3. (Wang Shiying), Yuan, DNA Marker Map and DNA Calculation, China Science, Series A: Mathematics, 2008,51(3): 437-452 (SCI: IDS number: 258 SK).
4. (Wang Shiying), Lin,, Formal Conditions of Super k- Restricted Edge Connectivity of Graphs with Diameter 2, Discrete Mathematics, 2009,309 (4): 908-919 (sci, EI) 5., Wang Shiying, Liu. Some markers of DNA profiles. Journal of north university of china, 29, 2008 (1): 4-7.
6. Wang Shiying (Wang Shiying), Wei,, Convenient Conditions of Graph-Optimal, Intelligent Information Management System and Technology, 2008,4 (1): 23-34.
7. Wang Shiying, Guo Jiwen, Primitive Index of a Class of (k+ 1)- Chromatic Directed Graphs, Applied Mathematics, 2008,21(4): 778-786.
8. Lin, Wang Shiying. Sufficient conditions of $/lambda_k$ optimal graph, mathematical understanding and practice, 2008,38 (12): 208-213.
9. (Wang Shiying), Lin, $/lambda' $- Optimal Directed Graph, Information Processing Express, 2008, 108 (6) 386-389 (SCIDS number: 370 ig, ei).
10. (Wang Shiying),,, Liu, Formal Conditions of Hyperarc Strongly Connected Graphs, Graph Theory and Combinatorics, 2008,24 (6): 587-595 (SCIDS number: 378RP).
1 1., Liu, (Wang Shiying), bipedal graph is the official condition of super-k- restricted edge connectivity, Discrete Mathematics, 2009,309 (9): 2886-2896 (SCI, EI).