關(guān)于堅(jiān)韌度和混合堅(jiān)韌度的一些結(jié)果.pdf

1、南京師范大學(xué)碩士學(xué)位論文關(guān)于堅(jiān)韌度和混合堅(jiān)韌度的一些結(jié)果姓名：崔錦雯申請學(xué)位級(jí)別：碩士專業(yè)：數(shù)學(xué)；運(yùn)籌學(xué)與控制論指導(dǎo)教師：孫志人20090516AbstractAbstractAllthegraphstalkedherearefiniteunientedsimpleconnected.TheproblemonreliabilityofgraphshasdevelopedaswellashavebeendevelopingwithGrap

2、hTheyreliabilityparametersthatproposedearliestareconnectivityedgeconnectivitywhicharenotenoughfthesceofthegraphs.”Toughness”theconceptproposedbyChvatalin1973acterizedtheremanentgraph.Afterthatsomescholarwerecontinuingtos

3、tudyontoughnesstheotherswerekeepingonattemptingnewparameterstoremedytheacterization.”Edgetoughness”theconceptproposedbyKatonain1997consideredthecasethatbothverticesedgesared.Buttheproblemthatjudgingwhetheragraphistedgeto

4、ughedisNP?Completed.AswellbaseingontheKatona’sconceptthearithmeticfedgetoughnessiscomplicated.Sosection2.1willgivetwoarithmetic，oneofwhichisthatoftheedgetoughnessaccdingtoKatona’sconcept.Viavalidatingtheequivalenceofthet

5、woarithmeticswewillgetanequivalentoftheconceptaccdingtowhichthecomplexityislessabit.Insection2.2wewilldiscusstheboundoftheedgetoughnessofthegraphonnverticestoacertainvalueinthisscope.Thenwetrytoconstructthegraphonnvertic

6、eswhichisoftheedgetoughnessthesameasthevaluehasgiven.wewillestimatetheedgetoughnessofsomeespecialgraphssuchassubgraphslinegraphstotalgraphsuniongraphsregulargraphsutilizingtherelationshipofthegraphstherelationoftheedgeto

7、ughnessthetoughness.Insection2.4wetalkedoverthescopeoftheedgetoughnessofregulargraphwhichisaidiographickindofgraphs.inthesection5wetrytosimplifythearithmeticIIsoastogivetheaccurateregular.Howeverthisarticlejustdiscusssom

8、eofthescopeoftheedgetoughnessofthegraphswhichisfarfromenoughfustoresearchintotheacteroftheedgetoughnessoftheGraph.Soinsection3webringfwardsomequestionsthatneedtoberesearcheddeeperfmyselfalsofthereaders.Keywds:arithmetict