圖的鄰點(diǎn)可區(qū)別全染色和邊染色.pdf

1、浙江師范大學(xué)碩士學(xué)位論文圖的鄰點(diǎn)可區(qū)別全染色和邊染色姓名：王藝橋申請學(xué)位級別：碩士專業(yè)：運(yùn)籌學(xué)與控制論指導(dǎo)教師：卜月華20090523ADJACENTVERTEXDISTlNGUISHINGEDGEANDTOTALCOLORINGSOFGRAPHSABSTRACTThecoloringofgraphhasbeenanimportantandactivebranchingraphtheoryresearchatalltimesInthis

2、thesis，weinvestigatetheadjacentvertexdistinguishingedgeandtotalcoloringsofsome蓼aphsBothconceptsareaninterestinggeneraliza—tionofordinaryedgecoloringandtotalcoloringofagraph，whichhavesignificantappHcationsintheFrequencyCh

3、annelAssignmentandotherproblemsLet兄(G)，碰(G)，△(G)，g(C)denotethe喇a(chǎn)centvertexdistinguishingedgechromarienumbegtheadjacentvertexdistinguishingtotalchromaticnumberthemaximumdegree，thegirthofagraphG，respectively，Thisthesiscons

4、istsoffivechaptersInChapter1，weintroducesomeconceptsandnotationusedinthethesis，andgiveachiefsurveyontherecentprogressofcoloringsunderconsiderationInChapter2，wecharacterizecompletelytheadjacentvertexdistinguishingtotalchr

5、omaticnumberofouterplanargraphsbyshowingthatifGisanouterplanargraphwitha(c)≥3，thena(c)1≤磁(G)≤A(C)2，andx：(G)=A(G)2ifandonlyifGcontainstwoadjacentverticesofmaximumdegreeInChapter3，westudytheadjacentvertexdistinguishingtota

6、lcoloringofgraphswiththemaximumaveragedegreelessthan3AsacorollarywedeterminetheadjacentvertexdistinguishingtotalchromaticnumberofplanargraphsGwithg(c)≥6andA(C)≥5InChapter4，westudytheadjacentvertexdistinguishingedgecolori