简介:一、问题提出一家鞋店在一段时间内销售了某种女鞋30双,其中各种尺码的鞋的销售量如下:鞋的尺码(单位:厘米)2222.52323.52424.525销售量(单位:双)12511731 在这个问题上,鞋店关心的不是鞋的尺码的平均数,而是关心哪种尺码的鞋销售得最多的问题。因而将产生一种新的特征数字来描述这组数据的集中趋势.二、阅读教材 P162-P165三、自学指导1.什么是众数?在一组数据中,的数据叫做这组数据的众数.本概念的特点:范围:在一组数据中对象:其中的一个数据特征:这个数据出现的次数最多.2.什么是中位数?将一组数据按排列,把处在的一个数据(或)叫做这组数据的中位数.本概念特点:方式:
简介:LetMbeacompactorientable3-manifoldwithMconnected.IfV∪SWisaHeegaardsplittingofMwithdistanceatleast6,thenthe-stabilizationofV∪SWalongMisunstabilized.HenceMhasatleasttwounstabilizedHeegaardsplittingswithdifferentgenera.ThebasictoolisaresultondiskcomplexgivenbyMasurandSchleimer.
简介:InapaperbyZhangandChenetal.(see[11]),aconjecturewasmadeconcerningtheminimumnumberofcolorsXat(G)requiredinapropertotal-coloringofGsothatanytwoadjacentverticeshavedifferentcolorsets,wherethecolorsetofavertexvisthesetcomposedofthecolorofvandthecolorsincidenttov.WefindtheexactvaluesofXat(G)andthusverifytheconjecturewhenGisaGeneralizedHalingraphwithmaximumdegreeatleast6.AgeneralizedHalingraphisa2-connectedplanegraphGsuchthatremovingalltheedgesoftheboundaryoftheexteriorfaceofG(thedegreesoftheverticesintheboundaryofexteriorfaceofGareallthree)givesatree.
简介: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.
简介:GeneralizedSteiriertriplesystems,GS(2,3,n,g),areequivalenttomaximumconstantweightcodesoveranalphabetofsizeg+1withdistance3andweight3inwhicheachcodewordhaslengthn.ThenecessaryconditionsfortheexistenceofaGS(2,3,n,g)are(n-1)g≡0(mod2),n(n-1)g2≡0(mod6),andn≥g+2.Thesenecessaryconditionsareshowntobesufficientbyseveralauthorsfor2≤g≤11.Inthispaper,threenewresultsareobtained.First,itisshownthatforanygiveng,g≡0(mod6)andg≥12,ifthereexistsaGS(2.3.n.g)foralln,g+2≤n≤7g+13.thenthenecessaryconditionsarealsosufficient.Next,itisalsoshownthatforanygiveng,g≡3(mod6)andg≥15,ifthereexistsaGS(2,3,n,g)foralln,n≡1(mod2)andg+2≤n≤7g+6,thenthenecessaryconditionsarealsosufficient.Finally,asanapplication,itisprovedthatthenecessaryconditionsfortheexistenceofaGS(2,3,n,g)arealsosufficientforg=12,15.
简介:Inthispaper,wepresentatheoreticalanalysisforlinearfiniteelementsuperconvergentgradientrecoveryonPar6mesh,thedualofwhichiscentroidalVoronoitessellationswiththelowestenergyperunitvolumeandisthecongruentcellpredictedbythethree-dimensionalGersho'sconjecture.Weshowthatthelinearfiniteelementsolutionu_handthelinearinterpolationu_1havesuperclosegradientonPar6meshes.Consequently,thegradientrecoveredfromthefiniteelementsolutionbyusingthesuperconvergencepatchrecoverymethodissuperconvergentto▽u.Anumericalexampleispresentedtoverifythetheoreticalresult.
简介:ThechoicenumberofagraphG,denotedbyX1(G),istheminimumnumberksuchthatifalistofkcolorsisgiventoeachvertexofG,thereisavertexcoloringofGwhereeachvertexreceivesacolorfromitsownlistnomatterwhatthelistsare.Inthispaper,itisshowedthatX1(G)≤3foreachplanegraphofgirthnotlessthan4whichcontainsno6-,7-and9-cycles.