简介：H.WangconsideredtheminimumdegreesconditionthatGhaslargevertexdisjointcyclesinbipartitegraphs.Motivatedbythis,weconsiderthesmallvertex-disjointcyclesinbipartitegraphsinthispaper.Weprovethefollowingresult:Letm≥3,n≥2andk≥1bethreeintegers.LetG=(V1,V2;E)beabipartitegraphwith|V1|=|V2|=n≥2k+1.Iftheminimumdegreeδ(G)≥k+1andx∈V(C)^∑d(x)≥m(n+1)+1foranycycleCofGwithlength2m,thenGcontainskvertex-disjointcyclesoflength4.Moreover,thedegreesconditionissharp.

简介：基于2-toroidal谎言superalgebras的环代数学的演讲，类型的toroidal谎言superalgebras的一个免费的地代表是，n用顶点操作员和bosonic地被构造。

简介：让G是一张边有颜色的图。单色的树分区问题是发现顶点的最小的数字拆散盖住的单色的树G的所有顶点。在作者的家以前的工作，这个问题是NP完全的，这被证明了；在那里不存在为它的任何经常的因素近似算法除非P=NP。在这篇论文，作者为任何固定整数r≥显示出那如果图G的边由r颜色是有颜色的，5叫了一张r-edge-colored图，这个问题仍然保持NP完全。为单色的路径(周期)的类似的结果抓住划分问题。因此，似乎发现这个问题能在多项式时间为被解决的有趣的图的一些班有趣。为为边有颜色的树的单色的路径分区问题的一个线性时间算法被给。

简介：Vertex激光测距仪是一款高精度的测高、测距和测角度的仪器。在茂密的植被和灌层内使用Vertex超声波来测量,当视线开阔,用激光能够测量到更远的距离,方便快捷。先进的技术使野外测量工作比以前更加快捷高效,节约了大量的时间和金钱,提高了测量精度,增加了生产率。

简介：Thispaperpresentsanewhybridgeneticalgorithmforthevertexcoverproblemsinwhichscan-repairandlocalimprovementtechniquesareusedforlocaloptimization.Withthehybridapproach,geneticalgorithmsareusedtoperformglobalexplorationinapopulation,whileneighborhoodsearchmethodsareusedtoperformlocalexploitationaroundthechromosomes.Theexperimentalresultsindicatethathybridgeneticalgorithmscanobtainsolutionsofexcellentqualitytotheprobleminstanceswithdifferentsizes.Thepuregeneticalgorithmsareoutperformedbytheneighborhoodsearchheuristicsprocedurescombinedwithgeneticalgorithms.

简介：

简介：AtrackreconstructionprogramCATSbasedonacellularautomatonhasbeendevelopedforthevertexdetectorsystemoftheHERA-BexperimentatDESY,AsegmentmodelofthecellularautomationusedfortrackingcanberegardedaslocaldiscreteformoftheDenby-Petersonneuralnet.Since1999CATShasbeenusedtoreconstructdatacollectedinHERA-B.Resultsonthetrackingperformance,andaccuracyofestimatesandcomputingtimearepresented.

简介：Inthispaper,wefocusonthevertex-fault-tolerantcyclesembeddingonenhancedhypercube,whichisanattractivevariantofhypercubeandisobtainedbyaddingsomecomplementaryedgesfromhypercube.LetFvbethesetoffaultyverticesinthen-dimensionalenhancedhypercubeQn,k（1≤k≤n-1）.When|Fv|=2,weshowedthatQn,k-Fvcontainsafault-freecycleofeveryevenlengthfrom4to2n-4wheren（n≥3）andfchavethesameparity;andcontainsafault-freecycleofeveryevenlengthfrom4to2n-4,simultaneously,containsacycleofeveryoddlengthfromn—fc+2to2n-3wheren（≥3）andfchavethedifferentparity.Furthermore,when|Fv|=fv≤n-2,weproofthatthereexiststhelongestfault-freecycle,whichisofevenlength2n-2fvwhethern（n>3）andfehavethesameparityornot;andthereexiststhelongestfault-freecycle,whichisofoddlength2n-2fv-1inQn,k—Fvwheren（≥3）andfchavethedifferentparity.

简介：如果在G和颜色没有2-colored周期，图G的合适的小锚着色被称为区分非循环的边着色的邻近的顶点的A边设定到u的事件不等于到υ的边事件的颜色集合，在的地方uυ∈E(G)。区分非循环的边的邻近的顶点G的色彩的数字，由χ′表示了一(G),是在区分G的非循环的边着色的一个邻近的顶点的颜色的最小的数字。如果，在这篇论文，我们证明那G(V，E)是没有孤立的边的一张图，那么χ′一(G)≤32Δ。

简介：LetXbea4-valentconnectedvertex-transitivegraphwithodd-prime-powerorderp^κ（κ≥1）andletAbethefullautomorphismgroupofX.Inthispaper,weprovethatthestabilizerAvofavertexvinAisa2-groupifp≠5，ora{2,3}-groupifp=5.Furthermore,ifp=5|Av|isnotdivisibleby3^2.Asaresult,weshowthatany4-valentconnectedvertex-transitivegraphwithodd-prime-powerorderp^κ(κ≥1）isatmost1-arc-transitiveforp≠5and2-arc-transitiveforp=5.

简介：Theaimofthispaperistoevaluatetheeffectsofuncertain-but-boundedparametersonthedynamicresponseofstructures.Bycombiningtheintervalmathematicsandthefiniteelementanalysis,themassmatrix,dampingmatrix,stiffnessmatrixandtheexternalloadsarerepresentedasintervalmatricesandvector.Withthehelpoftheoptimizationtheory,wepresentthevertexsolutiontheoremfordeterminingboththeexactupperboundsormaximumvaluesandtheexactlowerboundsorminimumvaluesofthedynamicresponseofstructures,inwhichtheseparametersreachtheirextremevaluesontheboundaryoftheintervalmass,damping,stiffnessmatricesandtheintervalexternalloadsvector.Threeexamplesareusedtoillustratethecomputationalaspectsofthepresentedvertexsolutiontheorem.

简介：Afeedbackvertexsetisasubsetofverticesinagraph,whosedeletionfromthegraphmakestheresultinggraphacyclic.Inthispaper,westudytheminimum-weightfeedbackvertexsetprobleminseriesparallelgraphsandpresentalinear-timeexactalgorithmtosolveit.

简介：AgraphissaidtobeK1,4-freeifitdoesnotcontainaninducedsubgraphisomorphictoK1,4.Letkbeanintegerwithk≥2.WeprovethatifGisaK1,4-freegraphoforderatleast11k-10withminimumdegreeatleastfour,thenGcontainskvertex-disjointcopiesofK1+(K1∪K2).