简介:设G(V,E)是简单连通图,T(G)为图G的所有顶点和边构成的集合,并设C是k-色集(k是正整数),若T(G)到C的映射f满足:对任意uv∈E(G),有f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv),并且C(u)≠C(v),其中C(u)={f(u)}∪{f(uv)|uv∈E(G)}.那么称f为图G的邻点可区别E-全染色(简记为k-AVDETC),并称χ_(at)~e(G)=min{k|图G有k-邻点可区别E-全染色}为G的邻点可区别E-全色数.图G的中间图M(G)就是在G的每一个边上插入一个新的顶点,再把G上相邻边上的新的顶点相联得到的.探讨了路、圈、扇、星及轮的中间图的邻点可区别E-全染色,并给出了这些中间图的邻点可区别E-全色数.
简介:LetXbeaweaklyCauchynormedspaceinwhichtheparallelogramlawholds,CbeaboundedclosedconvexsubsetofXwithonecontractingpointandTbean{a,b,c}-generalized-nonexpansivemappingfromCintoC.Weprovethattheinfimumoftheset{||x-T(x)||}onCiszero,studysomefactsconcerningthe{a,b,c}-generalized-nonexpansivemappingandprovethattheasymptoticcenterofanyboundedsequencewithrespecttoCissingleton.Dependingonthefactthatthe{a,b,0}-generalized-nonexpansivemappingfromCintoChasfixedpoints,accordingly,anotherversionoftheBrowder’sstrongconvergencetheoremformappingsisgiven.
简介:LetP(G,λ)bethechromaticpolynomialofagraphG.TwographsGandHaresaidtobechromaticallyequivalent,denotedG~H,ifP(G,λ)=P(H,λ).Wewrite[G]={H|H~G}.If[G]={G},thenGissaidtobechromaticallyunique.Inthispaper,wefirstcharacterizecertaincomplete6-partitegraphswith6n+1verticesaccordingtothenumberof7-independentpartitionsofG.Usingtheseresults,weinvestigatethechromaticityofGwithcertainstarormatchingdeleted.Asaby-product,manynewfamiliesofchromaticallyuniquecomplete6-partitegraphswithcertainstarormatchingdeletedareobtained.
简介:我们使用Ringel大厅代数学途径为在Xi被描绘的类型B2的量组学习正规基础元素[12]。然而,我们的途径在那里简化几计算。
简介:在α次积分C半群和双连续n次积分C半群的基础上,探讨了双连续α次积分C半群的扰动性,得到了双连续α次积分C半群的扰动定理,并且在局部Lipschitz连续条件下证明双连续α次积分C半群的扰动理论仍然成立.