關(guān)于圖的鄰點(diǎn)可區(qū)別全染色問題的研究.pdf

1、t023348學(xué)校代碼一三盟生￡辮充類型。蔓謄塹壅灝j江嫦漉：。麓學(xué)囊鎏學(xué)一位論文題目～立、士舅盟堡：量要匿型全鎏鯉￡絲塹盎一學(xué)科專業(yè)t一一望釜生當(dāng)～蕉j4一鎏』≥j一～卑級(jí)：一—蟄璺生墮～擘弓一一2妥旦璺2魚至!主=—?！绣称梗阂弧灰唤?。鰲～一指導(dǎo)教師：。二盟建：堡二，：?！盾X夯類號(hào)：—一畦楚一一答辯蒔晦2096年絲』旦!；lABSTRACTSTUDYoNTHEPRoBLEMoFADJACENTVERTEXDISTlNGUISHIN

2、GToTALCoLoRINGoFGRAPHSABSTRACTThecoloringproblemofgraphsisinducedbycomputerscience，whichhaswidelyapplicationinnetworksTheadjacentvertexdistinguishingtotalcoloringisthepropertotalcoloringwhichdemandstheadjacentvetticeswit

3、hdifferentcolorsetsThenotionofadjacentvertexdistinguishingtotalcoloringwasintroducedfirstlybyprofessorZhangZhongfuetalin2004，andtheauthorsconjecturedthatxdt(G)≤zx(a)3Inthismasterthesis，wemainlydiscusstheadjacentvertexdis

4、tinguishingtotalchromaticnumbersofsomespecialgraphsandprovethatZhang’SconjectureholdsforthesegraphsThenwegettheadjacentvertexdistinguishingtotalchromaticnumbersoftheHalinGraphsMoreoverweinvestigatetheGeneralizedPetersenG

5、raphs，provethatsomeclassesofpositiveintegerscan’tstructuretheGeneralizedPetersenGraphsandgettheresultthattheadjacentvertex—distinguishingtotalchromaticnumberis5Finallybasedonthenumberandtheparityofcirclescontainedbythegr

6、aph，wegettheaajacentvertexdistinguishingtotalchromaticnumberoftwoclassesofgraphsKeyWords：vertexcoloring，edgecoloring，totalcoloring，adjacentvertex—distinguishingtotalcoloring，adjacentvertexdistinguishingtotalchromaticnumb