Full metadata record
DC FieldValueLanguage
dc.contributor.author胡維新en_US
dc.contributor.authorHU, WEI-XINen_US
dc.contributor.author傅□霖en_US
dc.contributor.authorFU, HENG-LINen_US
dc.date.accessioned2014-12-12T02:05:12Z-
dc.date.available2014-12-12T02:05:12Z-
dc.date.issued1987en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#NT762507009en_US
dc.identifier.urihttp://hdl.handle.net/11536/53538-
dc.description.abstract把一個圖分割成遞增子圖的問題首先是由Y.Alavi 等五人所提出的,最近這個問題已 有了些進展,到目前為止是下列的圖已經被證明都可以如此分割;它們是星星森林( star forest ),分支度(degree)是質數次冪的正則圖(regular graph ),完全 兩部分圖(complete bipartite graph),和最大分支度(maximum degree)不大於 (n =1)╱2的圖具有遞增子圖分割,本文首先在第二章列出一些已知的結果,然 後在第三、四章中,我們介紹另外兩種新的圖形分割法,最後我們證明以下的圖具有 遞增子圖分割,它們是:像星星圖的森林(star-like forest),毛蟲(族)(cat- erpillar(family))和長腿毛蟲(族)(long-leg caterpillar(family))。zh_TW
dc.language.isozh_TWen_US
dc.subject遞增子圖zh_TW
dc.subject分割zh_TW
dc.subject星星森林zh_TW
dc.subject分支度zh_TW
dc.subject正則圖zh_TW
dc.subject毛蟲族zh_TW
dc.subjectSTAR-FORESTen_US
dc.subjectDEGREEen_US
dc.subjectREGULAR-GRAPHen_US
dc.subjectCATERPILLAR-FAMILYen_US
dc.subjectALAVI-Y.en_US
dc.title遞增子圖分割zh_TW
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
Appears in Collections:Thesis