简介：Thepaperproposesreactiongraphsasgraphicalrepresentationsofcomputationalobjects.Areactiongraphisadirectedgraphwithallitsarrowsandsomeofitsnodeslabeled.Computationsaremodledbygraphrewritingofasimplenature.Thebasicrewritingrulesembodytheessenceofboththecommunicationsamongprocessesandcut-eliminationsinproofs.Calculiofgraphsareideentifiedtogiveaformalandalgebraicaccountofreactiongraphsinthespiritofprocessalgebra.Withthehelpofthecalculi,itisdemonstratedthatreactiongraphscapturemanyinterestingaspectsofcomputations.

简介：AnapproximationalgorithmispresentedforaugmentinganundirectedweightedgraphtoaK-edge-connectedgraph.Thealgorithmisusefulfordesigningareliablenetwork.

简介：LetGbeasimplegraphwithnverticesandλn（G）betheleasteigenvalueofG.Inthispaper,weshowthat,ifGisconnectedbutnotcomplete,thenλn（G）≤λn(Kn-11)andtheequalityholdsifandonlyifGKn-11,whereKn-11,isthegraphobtainedbythecoalescenceofacompletegraphKn-1ofn-1verticeswithapathP2oflengthoneofitsvertices.

简介：

简介：Parallelgraphreductionisapromisingmodelfornewgenerationcomputerbecauseofitsamenabilitytobothprogrammingandparallelcomputing.Inthispaper,aninitialdesignforaparallelgraphreductionmodel,PGRmodel,ispresented,whichemployseagerevaluationstrategytoexploitconservativeparallelismandprovideswithprimitivesandassociatedtageofnodestosynchronizeconcurrenttasks.Moreover,adirectoperationaldescriptionofgraphreductionintermsofhighlevelinstructions(primitives)isgiventoobtainavirtualmachine,calledPGRVM.

简介：让Gn，d是有n顶点的一张随机的d常规的图，在此d=o(n)。给一张固定的图H，YH在Gn，d。在这篇论文，作者决定事件的阀值“YH>0'，并且也在阀值间隔内获得劝诱的潜水艇图计数。

简介：Bargraphsareconvenientforshowingcomparisonsamongitems．Thebarsmaybeeitherhorizontalorvertical,andtheyareusedtoshowtheamountsofdifferentitems．Figure1isanexampleofatypicalbargraph．ThegraphshowstheaveragesalespriceofexistinghomesintheNortheastUnitedStatesforthreeyears——1970,1980,and1997．

简介：ThestarchromaticnumberofagraphwasintroducedbyA.Vince,whichisanaturalgeneralizationofthechromaticnumberofagraph.Inthispaper,thestarchromaticnumbersofgraphproductsG(×)Harediscussedinsomespecialcases.

简介：GivenacompletegraphwithvertexsetXandsubsetsX1,X2,...,Xn,theproblemoffindingasubgraphGwithminimumnumberofedgessuchthatforeveryi=1,2,...,n,GcontainsaspanningtreeonXi,arisesinthedesignofvaccumsystems.Ingeneral,thisproblemisNP-completeanditisprovedthatforn=2and3thisproblemispolynomial-timesolvable.Inthispaper,weprovethatforn=4,theproblemisalsopolynomial-tlmesolvableandgiveamethodtoconstructthecorrespondinggraph.

简介：在这篇论文，一条新非线性的闭图定理被建立，其结果实质地改进一条最近知道重要结论。

简介：Wefirstapplynon-negativematrixtheorytothematrixK=D+A,whereDandAarethedegree-diagonalandadjacencymatricesofagraphG,respectively,toestablisharelationonthelargestLaplacianeigenvalueλ1(G)ofGandthespectralradiusp(K)ofK.Andthenbyusingthisrelationwepresenttwoupperboundsforλ1(G)anddeterminetheextremalgraphswhichachievetheupperbounds.

简介：AccordingtothelatestreportfromtheAfricanRefinersAssociation(ARA),atthecurrentrateofoilproduction,globalreserveswilldryoutinjust50years.Rightnow,theglobaldailyconsump-tionofoilisapproximately84millionbarrels,withapossiblemaximumof

简介：ThetransmissioncapacityofMobileAdHocNetworking(MANET)isconstrainedbythemutualinterferenceofconcurrenttransmissionsbetweennodes.First,thetransmissioncapacityofMANETisstudiedbytheviewofinformationflowbetweennodes.Atthesametime,theproblemthattheinterferencebetweennodesaffectsthetransmissioncapacityofMANETisalsostudiedbythetooloftheeventconflictgraph.Secondly,thepaperpresentsthemethodtocomputethemaximumex-pectantachievablecapacityforthegivenconflictgraph,andconcludesandprovesansufficientcon-ditionthattheinformationflowtransmitsuccessfullybetweennodes.Atlast,theresultsaresimulatedandafittingequationoftransmissioncapacitybetweennodesisgiven.

简介：Graphsarewidelyusedformodelingcomplicateddatasuchassocialnetworks,chemicalcompounds,proteininteractionsandsemanticweb.Toeffiectivelyunderstandandutilizeanycollectionofgraphs,agraphdatabasethatefficientlysupportselementaryqueryingmechanismsiscruciallyrequired.Forexample,SubgraphandSupergraphqueriesareimportanttypesofgraphquerieswhichhavemanyapplicationsinpractice.Aprimarychallengeincomputingtheanswersofgraphqueriesisthatpair-wisecomparisonsofgraphsareusuallyhardproblems.Relationaldatabasemanagementsystems(RDBMSs)haverepeatedlybeenshowntobeabletoefficientlyhostdifferenttypesofdatasuchascomplexobjectsandXMLdata.RDBMSsderivemuchoftheirperformancefromsophisticatedoptimizercomponentswhichmakeuseofphysicalpropertiesthatarespecifictotherelationalmodelsuchassortedness,properjoinorderingandpowerfulindexingmechanisms.Inthisarticle,westudytheproblemofindexingandqueryinggraphdatabasesusingtherelationalinfrastructure.Wepresentapurelyrelationalframeworkforprocessinggraphqueries.Thisframeworkreliesonbuildingalayerofgraphfeaturesknowledgewhichcapturemetadataandsummaryfeaturesoftheunderlyinggraphdatabase.Wedescribedifferentqueryingmechanismswhichmakeuseofthelayerofgraphfeaturesknowledgetoachievescalableperformanceforprocessinggraphqueries.Finally,weconductanextensivesetofexperimentsonrealandsyntheticdatasetstodemonstratetheefficiencyandthescalabilityofourtechniques.

简介：Inthispaper,anapproachtoconstructanontrivialend-regulargraphofanyorderundersomeconditionsaregiven.

简介：在一张连接图和它的相应的平面图之间的关系简短被考察。一个必要、足够的条件被给检测一张平面图什么时候对应于结。在平面图和几乎平面的Seifert表面之间的关系被讨论。用平面图，我们与为任何偶数n穿过数字n构造轮流出现的amphicheiral素数结4。这在Kirby的问题表上把一个肯定答案给问题1.66(B)。

简介：为分析称在冲突的制造者态度被介绍并且适用于达成一个brownfield性质的公平转移的问题的一个决定的重要性的正式方法论。他的对手的制造者态度在他他的自己的偏爱的考虑被表示的一个决定，以及那些。统治态度被用来建议在一个决定制造者由于他的态度在考虑多重观点的一种情形，他可以更重重地赞成一个观点。brownfield获得冲突的分析说明这方法论揭示的卓见的类型。

简介：一张签署的图是一张图，一个符号属于每个边。这篇论文从图扩大拉普拉斯算符矩阵的一些基本概念到签署的图。Inparticular，在最少的拉普拉斯算符特征值之间的关系和一张签署的图的失衡的海角被调查。

简介：

简介：Evolutionarycomputationtechniqueshavemostlybeenusedtosolvevariousoptimizationproblems,anditiswellknownthatgraphisomorphismproblem(GIP)isanondeterministicpolynomialproblem.Asimulatedannealing(SA)algorithmfordetectinggraphisomorphismisproposed,andtheproposedSAalgorithmiswellsuitedtodealwithrandomgraphswithlargesize.ToverifythevalidityoftheproposedSAalgorithm,simulationsareperformedonthreepairsofsmallgraphsandfourpairsoflargerandomgraphswithedgedensities0.5,0.1,and0.01,respectively.ThesimulationresultsshowthattheproposedSAalgorithmcandetectgraphisomorphismwithahighprobability.