完整後設資料紀錄
DC 欄位語言
dc.contributor.author周志宏en_US
dc.contributor.authorChih-Hung Chouen_US
dc.contributor.author翁志文en_US
dc.contributor.authorChih-Wen Wengen_US
dc.date.accessioned2014-12-12T02:29:04Z-
dc.date.available2014-12-12T02:29:04Z-
dc.date.issued2001en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#NT900507012en_US
dc.identifier.urihttp://hdl.handle.net/11536/69307-
dc.description.abstract我們重新探討利用“繞環逐點“的方法於距離正則圖上,並結合針對距離正則圖上的一個路徑做折返理論的技巧,這將有助於我們去判斷一個相交參數是否存在,在應用方面我們將利用折返理論重證A. Hiraki 證過的定理。zh_TW
dc.description.abstractWe review the technique of circuit chasing in the study of distance-regular graphs. Combing the technique with the retracing argument of a path in a distance-regular graph, it will help us to determine whether an intersection array exists. For an application we will apply the retracing argument to reprove a theorem which was proved by A.Hiraki [1].en_US
dc.language.isoen_USen_US
dc.subject距離正則圖zh_TW
dc.subject距離相交圖zh_TW
dc.subject折返理論zh_TW
dc.subject相交參數zh_TW
dc.subjectdistance-regular graphen_US
dc.subjectintersection diagramen_US
dc.subjectretracing argumenten_US
dc.subjectintersection arrayen_US
dc.title利用折返理論研究含有長度較長迴圈的距離正則圖zh_TW
dc.titleRetracing Argument for Distance-Regular Graphs with Large Girthen_US
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
顯示於類別:畢業論文