11394.一些樹圖的度結(jié)合邊重構(gòu)數(shù)

1、一些樹圖的度結(jié)合邊重構(gòu)數(shù)Degreeassociatededgereconstructionparametersofsometrees作者：周婷婷Author：——T——ingtingZhou——指導(dǎo)教師：馬美杰Supervisor：叢旦iji旦叢壘專業(yè)：運籌學(xué)與控塑迨Major：OperationalResearchandCybernetics學(xué)位：堡堂塹Degree：叢壘塾竺Q!墨￡i皇翌盟一一授予單位：浙江師荽盤堂Institut

2、e：———Z———h——e——j—i—a——n———g———N———o——rmalUniversity—一March，2016Degree—associatededgereconstructionparametersofsometreesABSTRACTTheGraphReconstructionConjecmreofUlamandKellyhasbeenopenformorethan50yearsItassertsthateveryg

3、raphwithatleastthreeverticesisuniquelyde—terminedbyitsmultisetofcardsSuchagraphisreconstructibleManyresearcherswereinterestedinthisconjecture，andobtainedsomeresultsaboutitNevertheless，theconjectureremainsopenHararypropos

4、edl三dge—ReconstructionConjecturein1964Itstatesthateverygraphwithmorethanthreeedgesisdeterminedbyitsedge—deck。Forareconstructiblegraph，HararyandPlantholtintroducedthereconstructionnumberMyrvoldproposedtheadversaryreconstr

5、uctionnumberMotivatedbyrecon—structionquestionsfordirectedgraphs，Ramachandrandefinedthedegree‘a(chǎn)ssociatedreconstructionnumberMonikandanetalintroducedthedegree—associatedanalogueofMyrvold’SadversaryconceptThedefinitionsofe

6、dge—reconstructioncanbedefinedsimilarlyInthereconstructiona略uments，weobtainedtheupperboundbyconsideringthepossiblereconstructionsfromasetofdegree—associatededge—cardsThelowerboundcanbeobtainedbythenumberofcommonedge—card

7、ssharedbyagraphwithGasmanyaspossibleFinally，wedeterminethedegree—associatededge—reconstructionpa—rametersofdouble—broomsandtreeswithdiameter4Inthismasterthesis，westudytwokindsofdegree—associatededge—reconstructionnumbers