怎么样的问题太笼统了。已经查询了该刊是核心期刊目录当中的，说明杂志在界内学术水平是很高的。
引用率和影响因子自然也不会太低的。不过不是所有人都适合选择这个期刊投稿的，核心级的适合升副高、高级职称的人员，其他职称人员也不必担心，树人论文网自然会根据每位的实际情况给出建议选择的。
中文版没有收录，英文版被SCI收录
《应用数学学报》英文版被国内、外重要数据库或权威性文摘期刊广泛收录，收录期刊包括 :
1 Science Citation Index Expended
2 Science Abstracts( 英 );
3 Mathematics Review(美);
4 Mathematics Abstracts(德)
5 俄罗斯文摘杂志
6 中国科学文摘;
7 中国数学文摘;
8 中国学术期刊文摘;
9 中国科学引文数据库,
10 清华学术期刊光盘版等
11 万方数据库
2012年文章和著作 1. Shiying Wang, Yuxing Yang, Fault tolerance in bubble-sort graph networks, Theoretical Computer Science, 2012, 421: 62-69(SCI特二区,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特一区，EI).5. Shiying Wang，Guozhen Zhang, Kai Feng, Fault tolerance in k-ary n-cube networks, Theoretical Computer Science, 460 (2012) 34–41 (SCI特二区,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特二区 ,EI)8. 王世英,李晶，杨玉星, 互连网络的容错嵌入(专著). 北京：科学出版社，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特二级区,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方体的圈嵌入.计算机工程与应用（二级主学报）, 20115. 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特二区,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特一区,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特一区,EI).8. 王世英，杨玉星，林上为，李晶. 图的孤立断裂度. 数学学报, 2011, 54(5) : 861-874(一级主学报）。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特二区,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. 杨玉星，王世英．泡形互连网络的条件连通性度量．计算机工程及其应用，2011, 47(22): 13-16.（二级主学报）．12. 林上为, 李春芳，王世英. 含有两个非临界点的强连通定向图的弧数. 运筹学学报，2011，15(3): 57-61（二级主学报）.2010年论文1. Shiying Wang, Shangwei Lin，Path embeddings in faulty 3-ary n-cubes, Information Sciences 180(1)(2010)191-197(SCI特一级区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特二级区SCI IDS 号: 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特二级区, IDS 号: 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特二级区,IDS 号: 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特二级区, EI).6. 李晶，王世英 . 求二部图的最大匹配图的一种算法.电子学报（一级主学报）, 2010,38(1):161-166.7. 张淑蓉，王世英.有故障点的广义4元n方体中不同长度的路的嵌入。计算机工程与应用（二级主学报）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. 王世英，任云霞. 网络边连通性的最优化.数学的实践与认识, 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. 王世英, 林上为. 网络连通性的最优化(专著).北京:科学出版社,2009.2. Shangwei Lin, Shiying Wang, Super p-Restricted Edge Connectivity of Line Graphs, Information Science, 179 (2009) 3122–3126 (SCI特一级区, 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.黄学臻, 林上为, 王世英. 一类无向Kautz图的k限制边连通度的上界,应用数学学报（一级主学报）,2009, 269-276.6. 王世英.交叉学科研究生教学的探讨, 山西财经大学学报(高等教育版)，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:)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图的标号. 中北大学学报，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)-色有向图的本原指数, 应用数学, 2008, 21(4):778-786.8. 林上为，王世英，李春芳. $/lambda_k$最优图的充分条件, 数学认识与实践, 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).
