圖覆蓋的研究

Full metadata record

DC Field	Value	Language
dc.contributor.author	詹棨丰	en_US
dc.contributor.author	Chi-Feng Chan	en_US
dc.contributor.author	傅恆霖	en_US
dc.contributor.author	Dr. Hung-Ling Fu	en_US
dc.date.accessioned	2014-12-12T02:03:38Z	-
dc.date.available	2014-12-12T02:03:38Z	-
dc.date.issued	2003	en_US
dc.identifier.uri	http://140.113.39.130/cdrfb3/record/nctu/#GT009122525	en_US
dc.identifier.uri	http://hdl.handle.net/11536/52391	-
dc.description.abstract	令G為一個給定的圖而H是G的子圖所形成的集合。使用最少數量H中的圖而能覆蓋所有G中的邊，而這個數量我們定義為cov(G ,H)。這篇論文中的主要工作是證明，如果G是一個三連通圖或者G的邊連通數是1或2，H是G的奇子圖所形成的集合，則cov(G ,H) 3。	zh_TW
dc.language.iso	zh_TW	en_US
dc.subject	圖覆蓋	zh_TW
dc.subject	三連通圖	zh_TW
dc.subject	奇子圖	zh_TW
dc.subject	cover	en_US
dc.subject	3 connected graph	en_US
dc.subject	odd subgraph	en_US
dc.title	圖覆蓋的研究	zh_TW
dc.title	A Study of Graph Covering	en_US
dc.type	Thesis	en_US
dc.contributor.department	應用數學系所	zh_TW
Appears in Collections:	Thesis

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.