图的交数与强交数.pdfVIP

THEsis:TheIntersectingNumberandtheStrongIntersecting NumberofGraph SPECIALIZATION:BasicMathematics POSTGRADUATE:WengLiangui MENTOR:ProfessorYaoTianXing Abstract LetX={xr2_.Am}beafiniteset,H=(E,,E2,._EabeafamilyofsubsetsofX,suchthat (1)E,#曰仲 1,2,...,n) (2)UE,=X ThenwecallHahypergraphonX,Theelementsx1,x2，二，x.ofXarecalledtheverticesofH, andthesetsE,,E2,...,EaretheedgesofH,Xiscalledthevertex setandmiscalledthe orderofH. IfHsatisfies (3)E;gEj-i=j thenwecallHasimplehypergraph. Definition1.SupposeH=(E,,E2，二,E)isahypergraphonX,theline-graphL(H)isa simplegraph,whoseverticesarepointsv,,v2_.,v,theverticesv;,vjbeingadjacentifandonly ifE,门Ejx0(ixj), Definition2.Theweakintersectingnumberai(G)ofasimplegraphistheminimum orderofthosehypergraphHwithL(H)}2G;theintersectingnumber。(句ofasimplegraphis theminimumorderofthosehypergraphHwithdistinctedgeswhichsatisfiesL(H)%gG;the strongintersectingnumberf2(仍ofasimplegraphistheminimumorderofthosehypergraphH withL(H)KG. InChapter11，westudysomepropertiesoftheintersectingnumberofsimplegraphs,and obtaintheintersectingnumberofthetrees,circlesandcompletegraphs.Wealsogivethebest possibleupperboundoftheplanarandouterplanargraphswithordern.Themaintheoremsof thissectionarelistedasfollows: Theorem 1SupposeGisasimpleplanargraphwithordern,then。(叨成 _n53 andforeachn,thisboundsharp n3 Theorem 2SupposeGis a simpleouterplanargraph,withordern,then。(句成 厂 1 15n至3 2 忆 e e L e s e s e s 尸 l 2 3 1 小 n31nadforeachn,thisboundsharp Theorem 3SupposeGIg a simpleouterplnaargraphwithordern,then诚0〕 nadforeachn,thisboundissharp InChapterIII,wesutdysomepropertiesofthestrongintersectingnumberofthesimple graphs,andobtainthestrongintersectingnumberofthetrees,circlesnadcompletegraphs.We alsogiveanecessarynadsufficientconditionfor侧句=6(仍，whereS(G)?2.nadgivethebest possibleupperbound几n