简介: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.
简介:<正>Foranyintegersa1,a2,a3,a4andcwitha1a2a3a40(modp),thispapershowsthatthereexistsasolutionX=(x1,x2,x3,x4)∈Z4ofthecongruencea1x12+a2x22+a3x32+a4x42≡c(modp)suchthat‖X‖=max{|x1|,|x2|,|x3|,|x4|}《p1/2logp.
简介:研究具有可选服务的M/M/1排队模型的主算子在左半实轴上的点谱.当顾客的到达率λ,必选服务的服务率μ1与可选服务的服务率μ2满足λ/μ1+λμ2〈1时,证明区间(η,-λ)中的所有点都是该主算子的几何重数为1的特征值,其中η=max{-μ1,-μ2,-4/3λ,-2λμ2/μ1+μ2-λ,-μ1μ2(μ1μ2-λμ1-λμ2)+λ3μ1(1-r)/[μ12(μ2-λ)+μ1μ2(μ1-λ)](1-r)+λ2μ1-λ},r表示顾客选择可选服务的概率.
简介:Thispaperpresentsaclassofr-point(r+1)st-orderA-stableone-blockmethodswithdampingattheinfinitepoint(DIAOBr,r+1).Undertheconditionsofthesameorder,A-stabili-ty,operationcount(ateachiterativestep)andstoragespacearethesameasthemethodsin[19],themethodsinthepaperimprovethestabilityinaneighborhoodattheinfinitepoint.And,byus-ingtheOOPImethod[20],itpossessesmuchfasterrateofconvergenceforsolvingsystemsofnon-linearequationsproducedbytheDIAOBr,r+1.
简介:证明对一切θ∈(0,1),所有θ(2√λη-λ-η)都是单重休假的M/M/1排队模型的主算子的几何重数为1的特征值.
简介:应用线性算子的积分群理论证明M/M^B/1排队模型的时间依赖解的存在唯一性,其次推出M/M/1排队模型的时间依赖解的存在唯一性。