简介:<正>WestudythesolvabilityoftheCauchyproblem(1.1)-(1.2)forthelargestpossibleclassofinitialvalues,forwhich(1.1)-(1.2)hasalocalsolution.Moreover,wealsostudythecriticalcaserelatedtotheinitialvalueu0,for1
简介:首先,研究了Erdos1合著网络的特征属性,一方面使用节点的度、介数、接近中心性来描述Erdos1合著网络节点重要性,另一方面使用特征向量中心性和本文提出的高阶度参数来描述Erdos1合著网络节点影响力;然后,分别用逼近理想解的排序(TOPSIS算法)算法和主成份分析(PCA)对节点重要性和影响力排序;最后,利用修改的网页排名(PageRank)算法讨论了网络科学原创性论文中最具影响力的论文。
简介:InthispaperweestablishsharpH¨olderestimatesofharmonicfunctionsonaclassofconnectedpostcriticallyfinite(p.c.f.)self-similarsets,andshowthatfunctionsinthedomainofLaplacianenjoythesameproperty.Somewell-knownexamples,suchastheSierpinskigasket,theunitinterval,thelevel3Sierpinskigasket,thehexagasket,the3-dimensionalSierpinskigasket,andtheVicseksetarealsoconsidered.
简介:AgraphGiscalledchromatic-choosableifitschoicenumberisequaltoitschromaticnumber,namelych(G)=χ(G).Ohba’sconjecturestatesthateverygraphGwith2χ(G)+1orfewerverticesischromaticchoosable.ItisclearthatOhba’sconjectureistrueifandonlyifitistrueforcompletemultipartitegraphs.Recently,Kostochka,StiebitzandWoodallshowedthatOhba’sconjectureholdsforcompletemultipartitegraphswithpartitesizeatmostfive.Butthecompletemultipartitegraphswithnorestrictionontheirpartitesize,forwhichOhba’sconjecturehasbeenverifiedarenothingmorethanthegraphsKt+3,2*(k-t-1),1*tbyEnotomoetal.,andKt+2,3,2*(k-t-2),1*tfort≤4byShenetal..Inthispaper,usingtheconceptoff-choosable(orL0-size-choosable)ofgraphs,weshowthatOhba’sconjectureisalsotrueforthegraphsKt+2,3,2*(k-t-2),1*twhent≥5.Thus,Ohba’sconjectureistrueforgraphsKt+2,3,2*(k-t-2),1*tforallintegerst≥1.