简介:图G的I全染色是指若干种颜色对图G的顶点和边的一个分配,使得任意两个相邻的点的颜色不同,任意两条相邻的边的颜色不同。在图G的一个I-全染色下,G的任意一个点的色集合是指该点的颜色以及与该点相关联的全体边的颜色构成的集合。图G的一个I-全染色称为是邻点可区别的,如果任意两个相邻点的色集合不相等。对一个图G进行邻点可区别I-全染色所用的最少颜色的数目称为图G的邻点可区别I-全色数。应用构造具体染色的方法给出Pm与Pn的邻点可区别I-全色数。
简介:Anewmeshfreemethodproposedbytheauthorswaspresented,inwhichthederivativesateachnodewereconstructedusingwholederivativeformulasthroughthenodesselectedaroundthenodeusinglocalCartesianframeinanautonomousmanner,sothatwithoutanyelementitcouldbeconsideredasacompletelymeshfreemethod.Themethodwastestedwithanumericalexample,andreliablesolutionwasobtainedwithhighaccuracyandefficiency.
简介:SOMENEWCONSTRUCTIONSOFCARTESIANAUTHENTICATIONCODESFROMSYMPLECTICGEOMETRYYOUHong;GAOYou(NortheastNormalUniversity,Changchun130...
简介:Inthispaper,twonewconstructionsofCartesianauthenticationcodesfromsymplecticgeometryarepresentedandtheirsizeparametersarecomputed.
简介:Inthispaper,theproblemoffault-tolerantroutingsinfault-tolerantnetworksisconsidered.Aroutinginanetworkassignstoeachorderedpairofnodesafixedpath.Allcommunicationamongnodesmustgoonthisrouting.Wheneitheranodeoralinkinafault-tolerantnetwork{ails,thecommunicationfromonenodetoanotherusingthisfaultyelementmustbesentviaoneormoreintermediatenodesalongasequenceofpathsdeterminedbythisrouting.Animportantandpracticalproblemishowtochoosearoutinginthenetworksuchthatintermediatenodestoensurecommunicationaresmallforanyfault-set,LetCdbeadirectedcycleoforderd.Inthispaper.Theauthor{irstdiscussesconnectivityofCartesianproductdigraphs,thenprovesthattheCartesianproductdigraphCd1×Cd2×…×Cdn(di≥2,1≤i≤n)hasaroutingsuchthatatmostoneintermediatenodeisneededtoensuretransmissionofmessagesamongallnon-faultynodessolongasthenumberoffaultsislessthann,ThisisageneralizationofDolevetal'sresultforthen-dimensionalcuhe.