3连通图的某些子图上的可去边

3连通图的某些子图上的可去边

ID:39098847

大小:783.45 KB

页数:25页

时间:2019-06-24

3连通图的某些子图上的可去边_第1页
3连通图的某些子图上的可去边_第2页
3连通图的某些子图上的可去边_第3页
3连通图的某些子图上的可去边_第4页
3连通图的某些子图上的可去边_第5页
资源描述:

《3连通图的某些子图上的可去边》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、山东大学硕士学位论文Removableedgesinsomespecialsubgraphof3·-connectedgraphsCaiYue(SchoolofMathematics,ShandongUniversity,Jinan,Shandong250100,P.R.China)ABSTRACTTheconnectivityofgraphsisoneofthemostimportantprop—ertiesofgraphs.Connectedgraphsplayanimportantroleinpracti—calapplicationsbecauseofitsclos

2、econnectionwithnetworkmodelandcombinatorialoptimization.Withtherapiddevelopmentofcom—putersandintemet,thisconnectioniSmorecloserthaneverbefore,whichmakesconnectedgraphsveryimportantinboththeoreticalre—spectandpracticalapplication.Discussingtheconstructionofcon—nectedgraphsisacuttingedgetop

3、icingraphtheory.Withinductionwidelyused,operationsingraphswhichareaseriesofalgorithmsthatreducethenumberofverticesoredgesinagraphwithkeepingsomepropertyaremoreusefuldaybyday.Inthiscontext,removableedgesandcontractibleedgesareusedinresearch.Thispaperforcusonthepropertiesofremovableedgesandc

4、on—tractibleedgesin3-connectedgraphs,andtheirdistributions.Inthispaper,Gisasimplegraph.ThefollowingarethemainresultsofthisPaper.First,wewillgiveadefinition.Considerthefollowingoperations:(1)DeleteefromG,resultinginthegraphG—e.(2)Ifsomeend—verticesofehavedegree2inG-e,thensuppressⅡI山东大学硕士学位论

5、文them.(3)Ifmultipleedgesoccur,weusesingleedgestoreplacethem.ThefinalresultantgraphisdenotedbyGee.Fora3-connectedgrahG,ifGeisstill3-connected,thentheedgeeiscalledremov—able;otherwise,itiscalledunremovable.ThesetofallremovableedgesofGisdenotedby昧(G);whereasthesetofallunremovableedgesofGisden

6、otedbyEN(G).Forremovableedgesin3-connectedgraphs,wewillgivesomeresults.Asfoliows:Conclusion1Gisa3-connectedgraph,Cisa6-cycleinG.Ifthereexistsatmostonesetof3verticesofdegree3,IE(C)nER(G)I≥1.Conclusion2Gisa3-connectedgraph,t,(G)≥6,Gisan-cycleinG.Ifthereexistsatmostonesetof3verticesofdegree3,

7、IE(c,1)nER(G)I≥1.Forremovableedgesoutsideaspanningtreein3-connectedgraphs,wegiveoneresultbasedontheresearchin3-regulargraph.Asfollows:Conclusion3Gisa3-connectedgraph,v(a)≥6.Iftheredosenotexistcontinuous2verticesofdegree3,thereareatleast2removableedgesoutsideas

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。