Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 曾雅榕 | en_US |
dc.contributor.author | Ya-JungTseng | en_US |
dc.contributor.author | 翁志文 | en_US |
dc.contributor.author | Chih-Wen Weng | en_US |
dc.date.accessioned | 2014-12-12T01:16:54Z | - |
dc.date.available | 2014-12-12T01:16:54Z | - |
dc.date.issued | 2007 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#GT009522541 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/38877 | - |
dc.description.abstract | 在數學的領域中,透過不同數學方法而得到相同的理論是常見 的。本論文的目的是探討,透過不同的兩個方法來証明強正則圖的參 數, 一個利用變數的計算(如定理7.6 所示),另一個是利用線性代數 的方法(如定理8.3). 結果顯示此強正則圖的參數呈現是一樣的。 | zh_TW |
dc.description.abstract | In the field of mathematics, it is common to achieve the same conclusion of the theory via various approaches. The purpose of this thesis is to probe the parameters of a strongly regular graph via two different methods, one (Theorem 7.6) with the use of counting argument and the other (Theorem 8.3) with a linear algebric method. The result shows that these parameters are determined explicitly and are the same. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | 距離正則圖 | zh_TW |
dc.subject | 強正則圖 | zh_TW |
dc.subject | distance-regular graph | en_US |
dc.subject | strongly regular graph | en_US |
dc.title | 由局限距離正則圖構造強正則圖的一種方法 | zh_TW |
dc.title | Construct Strongly Regular Graphs from D-bounded | 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.