姚兵，1982毕业于西北师范大学数学系，留校任教，现为副教授，硕士研究生导师,研究方向为图论及计算机应用、复杂网络理论与算法。在《JournalofGraphTheory》、《GraphTheoryAlgorithmsandApplications》《ActaMathematicaeApplicataeSinica》、《ScienceinChinaSer.A》、《InformationProcessingLetters》、《InformationScience》、《ActaMathematicaScientiaA》、《ArsCombinatoria》、《数学学报》等刊物上发表论文数十篇。现任《美国数学评论》的评论员。
?1992-1995年参与中科院应用数学研究所由王建方研究员领导的研究项目“图因子和组合不变量”(本项目组成员：王建方、张忠辅、姚兵等人),解决了素数度Cayley图和一类循环图的同构因子分解问题,给出了一类奇因子存在的充分必要条件,解决了几类图的路因子、圈因子分解问题,证明最大度充分大时全着色猜想成立,开辟了高度图的全着色研究。完满解决了世界著名数学大师Erd?s于1977年提出的关于图带宽的一个问题,并给出树带宽新上界,此界比前人的界趋于无穷小。
?于中国科学A辑：数学（2004年第5期）上发表的论文《关于图的邻点可区别全染色》被评为“中国百篇最具影响国内文章”。
?“图的邻点可区别染色及其相关问题研究”获2010年甘肃省教育厅科学技术进步壹等奖
?参与国家自然科学基金研究项目“图的染色理论研究”（**），2008.1-2009.12（已结项）
?参与国家自然科学基金研究项目“图的可区别染色理论与算法的研究”（**），2011.1-2015.12
?主持国家自然科学基金研究项目“基于生成树的图结构分析在无标度网络拓扑结构及其行为研究中的应用”（**），2011.1-2015.12
?主持国家自然科学基金研究项目“基于图论的物联网的拓扑结构和功能结构研究”（**），2014.1-2017.12
部分论著和论文
[1]BandwidthforGraphswithVerticesMerged,CombinatoricsGraphTheoryAlgorithmsandApplications,WorldScientifics,Singapore(1993),137-145.
[2]OnThesub-sumbandwidthofgraphs,ProceedingofDiscreteMathematicsandItsApplication,PekingUniversityPress,ISBN**-4/O.0346(1994),27-34.
[3]OnSub-bandwidthsofGraph,GraphTheoryAlgorithmsandApplications,WorldScientifics,Singapore,(1995),131-144.
[4]OnUpperBoundsofBandwidthsofTrees,ACTAMathmaticaeApplicataeSinica,11(2),(1995).152-159.
[5]Maximumbandwidthunderedgeaddition.J.GraphTheory20(1995),87-90.
[6]OnBandwidthSumofGraphs,ACTAMathmaticaeApplicataeSinica,11No.1(1995),69-78.
[7]Bandwidthandsomeparametersofgraphs,Proc.8thQuadrennialInternat.Conf.onGraphTheory,Combin.,Algor.andAppl.VolI,1999,pp.33-41.
[8]OnTheL(2,1)-labelingCoreGraphofGraphs,MathematicsInEconomics(China),19No.4(2002),14-19.
[9]Anoteontheupperboundofadjacentvertexdistinguishingchromaticnumberofgraphs,JournalofLanzhouJiaotongUniversity(NaturalSciences),23(6)(2004).143-145.
[10]关于图的邻点可区别全染色,中国科学A辑,2004,34(5).574-583.
[11]Onadjacent-vertex-distinguishingtotalcoloringofgraphs,ScienceinChinaSer.Amathematics,2005,48(3).289-299.
[12]Zhangzhongfu,Lijingwen,Chenxiang’en,Yaobing,WangWenjieandQiuPengxiang,D(b)-vertex-distinguishingtotalcoloringofgraphs,ScienceinChinaSer.Amathematics,49(10),(2006).1430-1440.
[13]Edge-facechromaticnumberof2-connectedplanegraphswithhighmaximumdegree.ActaMathematicaScientia26B(3)(2006),477-482.
[14]图的距离不大于D(b)的任意两点可区别的边染色,数学学报,2006,49(3).703-708.
[15]图的距离不大于b的点可区别全染色,中国科学A辑数学,2006,36(10).1119-1130.
[16]AClassofSpanningTrees.InternationalJournalofComputer,MathematicalSciencesandApplications,1.No.2-4,April-December2007,191-198.
[17]SomeGraphswithMagicalLabelling.InternationalJournalofPureandAppliedMathematics,34No.2(2007),153-161.
[18]Onstartotalcoloring.2007InternationalConferenceonGraphTheoryandCombinatorics&FourthCross-straitConferenceonGraphTheoryandCombinatorics,Taiwan,2007,121-125..
[19]图的邻点可区别的全染色,中国科学A辑数学,2007,37(9).1073-1082.
[20]Anewtypeofmagicalcoloring.AdvancesinMathematics(China),37(5),(2008),571-583.
[21]OnGracefulGeneralizedSpidersandCaterpillars,ArsCombinatoria87(2008),181-191.
[22]OnIncidenceGraphs,ArsCombinatoria87(2008),213-223.
[23]OnTheAdjacent-VertexStrong-distinguishingTotalColoringofGraphs,ScienceinChinaSeriesA,51(3),(2008).427-436.
[24]Onthevertexdistinguishingequitableedge-coloringofgraphs,ArsCombinatoria86(2008),193-200.
[25]Vertex-distinguishingtotalcoloringofgraphs,ArsCombinatoria87(2008),33-45.
[26]ANoteonStronglyGracefulTrees.ArsCombinatoria92(2009),155-169.
[27]TheSmarandachelyadjacent-vertextotalcoloringofthreeclassesof3-regularHalingraphs.Proceedings-2009InternationalConferenceonComputationalIntelligenceandSoftwareEngineering,CiSE2009.DOI:10.1109/CISE.2009.**
[28]Anoteonthedefinitionofatree.Theproceedingofthe2ndInternationalConferenceonBiomedicalEngineeringandInformatics,IEEE(USA)(2009),2137-2141.DOI:10.1109/BMEI.2009.**
[29]Adjacentstrongedgecoloringsandtotalcoloringsofregulargraphs.SciChinaSerA,52(5)(2009),973-980,DOI:10.1007/s11425-008-0153-5.
[30]有向图的理论、算法及其应用(DigraphsTheory,AlgorithmsandApplicationseditedbyJorgenBang-JensenandGregoryGutin).科学出版社.《现代数学译丛》,(83.5万字),ISBN978-7-03-022804-8,2009.1.
[31]Approximationtolargestgracefulsubgraphswithconstrainedconditions.Proceedingsof20103rdInternationalConferenceonBiomedicalEngineeringandInformatics(BMEI2010),2547-2551.IEEECatalogNumber.CFP1093D-CDRISBN.978-1-4244-6495-1.INSPECAccessionNumber.**.
DOI:10.1109/BMEI.2010.**.
[32]OnGeneralizedAntiaverageProblem.ArsCombinatoriaVolumeXCVI,July,2010,145-157
[33]LeavesAndInverseDegreeOfAGraph.Proceedingsof20103rdInternationalConferenceonBiomedicalEngineeringandInformatics(BMEI2010),3055-3059.IEEECatalogNumber.CFP1093D-CDRISBN.978-1-4244-6495-1.DOI:10.1109/BMEI.2010.**
[34]Someresultsonspanningtrees.ActaMathematicaeApplicataeSinica,EnglishSeries,2010,26(4).607-616.DOI:10.1007/s10255-010-0011-4
[35]Anewgraphlabellingontrees.Proceedingsof20103rdInternationalConferenceonBiomedicalEngineeringandInformatics(BMEI2010),2265-2269.IEEECatalogNumber.CFP1093D-CDRISBN.978-1-4244-6495-1.DOI:10.1109/BMEI.2010.**.
[36]图着色下的树顶点邻集的行为.数学物理学报,2011,31(2).567-576.
[37]数学奇乐园“历险”记(全彩)(15.6万字,230页),电子工业出版社,2011年,ISBN:978-7-121-14281-9(JinAkiyamaandMari-JoRuiz.Aday'sadventureinMathematicsWonderland.WorldScientific(www.worldscientific.com)。秋山仁(JinAkiyama)博士是日本东海大学教授,日本著名数学家,国际权威组合数学杂志GraphsandCombinatorics的主编)
[38]OnGracefulnessofDirectedTreeswithShortDiameters.BulletinoftheMalaysianMathematicalSciencesSociety,2012,(2)35(1).133-146.WOS:**012
[39]SpanningTreesAndDominatingSetsInScale-FreeNetworks//ShaoziLi,YunCheng.Proceedingson2012IETInternationalConferenceonInformationScienceandControlEngineering,Volume1,IETPress,2012.111-115(ISBN.978-1-84919-641-3)
[40]LabellingsAndInvariantsOfModelsFromComplexNetworks.Proceedingof2012InternationalConferenceonSystemsandInformatics.IEEEcatalognumber.CFP1273R-CDR.DOI:10.1109/ICSAI.2012.**
[41]Odd-ElegantLabellingInTreeDecompositionOfNetworks.Proceedingson2012IETInternationalConferenceonInformationScienceandControlEngineering,Volume1,IETPress,2012.78-82(ISBN.978-1-84919-641-3)
[42]Aprooftotheodd-gracefulnessofalllobsters.ArsCombinatoria103(2012),13-18.WOS:**002
[43]GraphsAsModelsofScale-freeNetworks.AppliedMechanicsandMaterials,Vol.380-384(2013)pp2034-2037.
DOI:10.4028/www.scientific.net/AMM.380-384.2034
[44]OnTheCollapseOfGraphsRelatedtoScale-FreeNetworks.ProceedingofICIST2013.ThirdInternationalConferenceonInformationScienceandTechnologyMarch23-25,2013;738-743.978-1-4673-2764-0/13IEEE
[45]InducedTotalLabellingsofModelsasScale-freeNetworks.CommunicationsandNetwork,Vo.513-517,2013,5,65-68.DOI:10.4236/cn.2013.53B2013
[46]ApplyingGraphTheoryToTheInternetofThings.2013IEEEInternationalConferenceonHighPerformanceComputingandCommunicationsand2013IEEEInternationalConferenceonEmbeddedandUbiquitousComputing,2354-2361.DOI:10.1109/HPCC.and.EUC.2013.339
[47]On(k,lamda)-magicallytotallabelingofgraphs.JCMCC(JournalofCombinatorialMathematicsandCombinatorialComputing,ISSN:8353-3026)87(2013)pp.237-253
[48]Onequitablevertexdistinguishingedgecoloringsoftrees.ActaMathematicaScientia2013,33B(3):621-630
[49]OnDefectedColoringsofGraphs.ActaMathematicaeApplicataeSinica,EnglishSeries,Vol.29,No.4(2013)777-786.DOI:10.1007/s10255-013-0255-x,DO:10.1007/s10255-013-0255-x
[50]GraphColoringsAppliedInScale-FreeNetworks.AdvancedMaterialsResearch,Volumes760-762,pp2199-2204.
DOI:10.4028/www.scientific.net/AMR.760-762.2199
[51]Ontheadjacentvertexdistinguishingproperedgecoloringsofseveralclassesofcomplete5-partitegraphs.AppliedMechanicsandMaterialsVols.333-335(2013)pp1452-1455.DOI:10.4028/www.scientific.net/AMM.333-335.1452
[52]Edge-MagicTotalLabellingsOfSomeNetworkModels.AppliedMechanicsandMaterialsVols.347-350(2013)pp2752-2757.
DOI:10.4028/www.scientific.net/AMM.347-350.2752.
[53]LabellingPropertiesOfModelsRelatedwithComplexNetworksBasedOnConstructibleStructures.AdvancedMaterialsResearchVols.765-767(2013)pp1118-1123.DOI:10.4028/www.scientific.net/AMR.765-767.1118
[54]FelicitousLabellingsofSomeNetworkModels.JournalofSoftwareEngineeringandApplications,2013,6,29-32.DOI:10.4236/jsea.2013.63b007
[55]EveryLobsterIsOdd-elegant.InformationProcessingLetters113(2013)30-33.
[56]OnOdd-gracefulnessofAllSymmetricTrees.JCMCC(JournalofCombinatorialMathematicsandCombinatorialComputing,ISSN:8353-3026,87(2013)pp.309-319
[57]不具有3AP整数集的一个新问题.数学物理学报,2013,33A(1).145-151
[58]LabellingEdgesofModelsfromComplexNetworks.AppliedMechanicsandMaterials,Volumes513-517,pp1858-1862.
DOI:10.4028/www.scientific.net/AMM.513-517.1858
[59]ResearchonEdge-GrowingModelsRelatedwithScale-FreeSmall-WorldNetworks.AppliedMechanicsandMaterials,Volumes513-517,pp2444-2448.DOI:10.4028/www.scientific.net/AMM.513-517.2444
[60]Adjacentvertexdistinguishingtotalcoloringsofgraphswithsmallerdefree.Journalofmathematics,2014,34(2),pp295-302.
[61]GeneralizedEdge-MagicTotalLabellingsOfModelsfromreseachingNetworks.InformationSciences279(2014)460-467.DOI:10.1016/j.ins.2014.03.132
[62]LabellingSun-likeGraphsFromScale-freeSmall-worldNetworkModels.Proceedingof2014SixthInternationalConferenceonMeosuringTechnologyandMechatronicsAutomation.IEEEComputerSocietyOrderNumberE3434,ISBN:978-1-4799-3434-8INSPECAccessionNumber:**,2014,pp378-384.DOI:10.1109/ICMTMA.2014.93