姚兵，1982畢業于77779193永利數學系，留校任教，現為副教授，碩士研究生導師, 研究方向為圖論及計算機應用、複雜網絡理論與算法。在《Journal of Graph Theory》、《Graph Theory Algorithms and Applications》《Acta Mathematicae Applicatae Sinica》、《Science in China Ser.A》、《Information Processing Letters》、《Information Science》、《Acta Mathematica Scientia A》、《Ars Combinatoria》、《數學學報》等刊物上發表論文數十篇。現任《美國數學評論》的評論員。
• 1992-1995年參與中科院應用數學研究所由王建方研究員領導的研究項目“圖因子和組合不變量”(本項目組成員：王建方、張忠輔、姚兵等人), 解決了素數度Cayley圖和一類循環圖的同構因子分解問題, 給出了一類奇因子存在的充分必要條件, 解決了幾類圖的路因子、圈因子分解問題, 證明最大度充分大時全着色猜想成立, 開辟了高度圖的全着色研究。完滿解決了世界著名數學大師Erdös于1977年提出的關于圖帶寬的一個問題, 并給出樹帶寬新上界, 此界比前人的界趨于無窮小。
• 于中國科學A輯：數學（2004年第5期）上發表的論文《關于圖的鄰點可區别全染色》被評為“中國百篇最具影響國内文章”。
• “圖的鄰點可區别染色及其相關問題研究”獲2010年甘肅省教育廳科學技術進步壹等獎
• 參與國家自然科學基金研究項目“圖的染色理論研究”（10771091），2008.1-2009.12（已結項）
• 參與國家自然科學基金研究項目“圖的可區别染色理論與算法的研究”（61163037），2011.1-2015.12
• 主持國家自然科學基金研究項目“基于生成樹的圖結構分析在無标度網絡拓撲結構及其行為研究中的應用”（61163054），2011.1-2015.12
• 主持國家自然科學基金研究項目“基于圖論的物聯網的拓撲結構和功能結構研究”（61363060），2014.1-2017.12
部分論著和論文
[1] Bandwidth for Graphs with Vertices Merged, Combinatorics Graph Theory Algorithms and Applications, World Scientifics, Singapore (1993), 137-145.
[2] On The sub-sum bandwidth of graphs, Proceeding of Discrete Mathematics and Its Application, Peking University Press, ISBN 7 301 02699-4/O. 0346 (1994), 27-34.
[3] On Sub-bandwidths of Graph, Graph Theory Algorithms and Applications, World Scientifics, Singapore, (1995), 131-144.
[4] On Upper Bounds of Bandwidths of Trees, ACTA Mathmaticae Applicatae Sinica, 11(2), (1995).152-159.
[5] Maximum bandwidth under edge addition. J. Graph Theory 20 (1995), 87-90.
[6] On Bandwidth Sum of Graphs, ACTA Mathmaticae Applicatae Sinica, 11 No.1 (1995), 69-78.
[7] Bandwidth and some parameters of graphs, Proc. 8th Quadrennial Internat. Conf. on Graph Theory, Combin., Algor. and Appl. Vol I, 1999, pp. 33-41.
[8] On The L(2, 1)-labeling Core Graph of Graphs, Mathematics In Economics (China), 19 No.4 (2002), 14-19.
[9] A note on the upper bound of adjacent vertex distinguishing chromatic number of graphs, Journal of Lanzhou Jiaotong University (Natural Sciences), 23(6) (2004).143-145.
[10] 關于圖的鄰點可區别全染色, 中國科學 A輯, 2004, 34(5).574-583.
[11] On adjacent-vertex-distinguishing total coloring of graphs, Science in China Ser. A mathematics, 2005, 48(3).289-299.
[12] Zhang zhongfu, Li jingwen, Chen xiang’en, Yao bing, Wang Wenjie and Qiu Pengxiang, D(b)-vertex-distinguishing total coloring of graphs, Science in China Ser. A mathematics, 49(10), (2006).1430-1440.
[13] Edge-face chromatic number of 2-connected plane graphs with high maximum degree. Acta Mathematica Scientia 26B(3) (2006), 477-482.
[14] 圖的距離不大于D(b)的任意兩點可區别的邊染色, 數學學報, 2006, 49(3). 703-708.
[15] 圖的距離不大于b的點可區别全染色, 中國科學 A輯 數學, 2006, 36(10). 1119-1130.
[16] A Class of Spanning Trees. International Journal of Computer, Mathematical Sciences and Applications, 1. No. 2-4, April-December 2007, 191-198.
[17] Some Graphs with Magical Labelling. International Journal of Pure and Applied Mathematics, 34 No. 2 (2007), 153-161.
[18] On star total coloring. 2007 International Conference on Graph Theory and Combinatorics & Fourth Cross-strait Conference on Graph Theory and Combinatorics, Taiwan, 2007, 121-125..
[19] 圖的鄰點可區别的全染色, 中國科學 A輯 數學, 2007, 37(9). 1073-1082.
[20] A new type of magical coloring. Advances in Mathematics(China), 37(5), (2008), 571-583.
[21] On Graceful Generalized Spiders and Caterpillars, Ars Combinatoria 87 (2008), 181-191.
[22] On Incidence Graphs, Ars Combinatoria 87 (2008), 213-223.
[23] On The Adjacent-Vertex Strong-distinguishing Total Coloring of Graphs, Science in China Series A, 51(3), (2008). 427-436.
[24] On the vertex distinguishing equitable edge-coloring of graphs, Ars Combinatoria 86 (2008), 193-200.
[25] Vertex-distinguishing total coloring of graphs, Ars Combinatoria 87 (2008), 33-45.
[26] A Note on Strongly Graceful Trees. Ars Combinatoria 92 (2009), 155-169.
[27] The Smarandachely adjacent-vertex total coloring of three classes of 3-regular Halin graphs. Proceedings-2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009. DOI:10.1109/CISE.2009.5364322
[28] A note on the definition of a tree. The proceeding of the 2nd International Conference on Biomedical Engineering and Informatics, IEEE (USA) (2009), 2137-2141. DOI: 10.1109/BMEI.2009.5304812
[29] Adjacent strong edge colorings and total colorings of regular graphs. Sci China Ser A, 52(5) (2009), 973-980, DOI: 10.1007/s11425-008-0153-5.
[30] 有向圖的理論、算法及其應用(Digraphs Theory, Algorithms and Applications edited by Jorgen Bang-Jensen and Gregory Gutin). 科學出版社.《現代數學譯叢》, (83.5萬字), ISBN 978-7-03-022804-8, 2009.1.
[31] Approximation to largest graceful subgraphs with constrained conditions. Proceedings of 2010 3rd International Conference on Biomedical Engineering and Informatics (BMEI 2010), 2547-2551. IEEE Catalog Number. CFP1093D-CDR ISBN. 978-1-4244-6495-1.INSPEC Accession Number. 11663184.
DOI:10.1109/BMEI.2010.5639705.
[32] On Generalized Antiaverage Problem. Ars Combinatoria Volume XCVI, July, 2010, 145-157
[33] Leaves And Inverse Degree Of A Graph. Proceedings of 2010 3rd International Conference on Biomedical Engineering and Informatics (BMEI 2010), 3055-3059. IEEE Catalog Number. CFP1093D-CDR ISBN. 978-1-4244-6495-1. DOI: 10.1109/BMEI.2010.5639359
[34] Some results on spanning trees. Acta Mathematicae Applicatae Sinica, English Series, 2010, 26(4).607-616. DOI: 10.1007/s10255-010-0011-4
[35] A new graph labelling on trees. Proceedings of 2010 3rd International Conference on Biomedical Engineering and Informatics (BMEI 2010), 2265-2269. IEEE Catalog Number. CFP1093D-CDR ISBN. 978-1-4244-6495-1. DOI:10.1109/BMEI.2010.5639422.
[36] 圖着色下的樹頂點鄰集的行為. 數學物理學報, 2011, 31(2). 567-576.
[37] 數學奇樂園“曆險” 記 (全彩) (15.6萬字, 230頁), 電子工業出版社, 2011年, ISBN:978-7-121-14281-9 (Jin Akiyama and Mari-Jo Ruiz. A day's adventure in Mathematics Wonderland. World Scientific (www.worldscientific.com)。秋山仁 (Jin Akiyama) 博士是日本東海大學教授, 日本著名數學家, 國際權威組合數學雜志Graphs and Combinatorics的主編)
[38] On Gracefulness of Directed Trees with Short Diameters. Bulletin of the Malaysian Mathematical Sciences Society, 2012, (2) 35(1). 133-146. WOS:000298904000012
[39] Spanning Trees And Dominating Sets In Scale-Free Networks // Shaozi Li, Yun Cheng. Proceedings on 2012 IET International Conference on Information Science and Control Engineering, Volume 1, IET Press, 2012.111-115 (ISBN. 978-1-84919-641-3)
[40] Labellings And Invariants Of Models From Complex Networks. Proceeding of 2012 International Conference on Systems and Informatics. IEEE catalog number. CFP1273R-CDR. DOI: 10.1109/ICSAI.2012.6223350
[41] Odd-Elegant Labelling In Tree Decomposition Of Networks. Proceedings on 2012 IET International Conference on Information Science and Control Engineering, Volume 1, IET Press, 2012.78-82 (ISBN. 978-1-84919-641-3)
[42] A proof to the odd-gracefulness of all lobsters. Ars Combinatoria 103 (2012), 13-18. WOS:000298767700002
[43] Graphs As Models of Scale-free Networks. Applied Mechanics and Materials, Vol.380-384 (2013) pp 2034-2037.
DOI: 10.4028/www.scientific.net/AMM.380-384.2034
[44] On The Collapse Of Graphs Related to Scale-Free Networks. Proceeding of ICIST2013.Third International Conference on Information Science and Technology March 23-25, 2013;738-743. 978-1-4673-2764-0/13 IEEE
[45] Induced Total Labellings of Models as Scale-free Networks. Communications and Network, Vo. 513-517, 2013, 5, 65-68. DOI: 10.4236/cn.2013.53B2013
[46] Applying Graph Theory To The Internet of Things.2013 IEEE International Conference on High Performance Computing and Communications and 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2354-2361. DOI: 10.1109/HPCC.and.EUC.2013.339
[47] On (k, lamda)-magically total labeling of graphs. JCMCC (Journal of Combinatorial Mathematics and Combinatorial Computing, ISSN:8353-3026) 87 (2013) pp.237-253
[48] On equitable vertex distinguishing edge colorings of trees. Acta Mathematica Scientia 2013, 33 B (3):621-630
[49] On Defected Colorings of Graphs. Acta Mathematicae Applicatae Sinica, English Series, Vol. 29, No. 4(2013) 777-786. DOI:10.1007/s10255-013-0255-x, DO: 10.1007/s10255-013-0255-x
[50] Graph Colorings Applied In Scale-Free Networks. Advanced Materials Research, Volumes 760-762, pp2199-2204.
DOI: 10.4028/www.scientific.net/AMR.760-762.2199
[51] On the adjacent vertex distinguishing proper edge colorings of several classes of complete 5-partite graphs. Applied Mechanics and Materials Vols. 333-335 (2013) pp 1452-1455.DOI:10.4028/www.scientific.net/AMM.333-335.1452
[52] Edge-Magic Total Labellings Of Some Network Models. Applied Mechanics and Materials Vols. 347-350 (2013) pp 2752-2757.
DOI:10.4028/www.scientific.net/AMM.347-350.2752.
[53] Labelling Properties Of Models Related with Complex Networks Based On Constructible Structures. Advanced Materials Research Vols. 765-767 (2013) pp 1118-1123. DOI:10.4028/www.scientific.net/AMR.765-767.1118
[54] Felicitous Labellings of Some Network Models. Journal of Software Engineering and Applications, 2013, 6, 29-32. DOI:10.4236/jsea.2013.63b007
[55] Every Lobster Is Odd-elegant. Information Processing Letters 113 (2013) 30-33.
[56] On Odd-gracefulness of All Symmetric Trees. JCMCC(Journal of Combinatorial Mathematics and Combinatorial Computing, ISSN:8353-3026, 87(2013) pp.309-319
[57] 不具有 3AP 整數集的一個新問題. 數學物理學報, 2013, 33A(1). 145-151
[58] Labelling Edges of Models from Complex Networks. Applied Mechanics and Materials, Volumes 513-517, pp1858-1862.
DOI:10.4028/www.scientific.net/AMM.513-517.1858
[59] Research on Edge-Growing Models Related with Scale-Free Small-World Networks. Applied Mechanics and Materials, Volumes 513-517, pp 2444-2448. DOI:10.4028/www.scientific.net/AMM.513-517.2444
[60] Adjacent vertex distinguishing total colorings of graphs with smaller defree. Journal of mathematics, 2014, 34(2), pp 295-302.
[61] Generalized Edge-Magic Total Labellings Of Models from reseaching Networks. Information Sciences 279 (2014) 460-467. DOI:10.1016/j.ins.2014.03.132
[62] Labelling Sun-like Graphs From Scale-free Small-world Network Models. Proceeding of 2014 Sixth International Conference on Meosuring Technology and Mechatronics Automation. IEEE Computer Society Order Number E3434, ISBN:978-1-4799-3434-8 INSPEC Accession Number:14252390, 2014, pp378-384. DOI: 10.1109/ICMTMA.2014.93
