Full metadata record
DC FieldValueLanguage
dc.contributor.author曾雅榕en_US
dc.contributor.authorYa-JungTsengen_US
dc.contributor.author翁志文en_US
dc.contributor.authorChih-Wen Wengen_US
dc.date.accessioned2014-12-12T01:16:54Z-
dc.date.available2014-12-12T01:16:54Z-
dc.date.issued2007en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT009522541en_US
dc.identifier.urihttp://hdl.handle.net/11536/38877-
dc.description.abstract在數學的領域中,透過不同數學方法而得到相同的理論是常見 的。本論文的目的是探討,透過不同的兩個方法來証明強正則圖的參 數, 一個利用變數的計算(如定理7.6 所示),另一個是利用線性代數 的方法(如定理8.3). 結果顯示此強正則圖的參數呈現是一樣的。zh_TW
dc.description.abstractIn 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.isoen_USen_US
dc.subject距離正則圖zh_TW
dc.subject強正則圖zh_TW
dc.subjectdistance-regular graphen_US
dc.subjectstrongly regular graphen_US
dc.title由局限距離正則圖構造強正則圖的一種方法zh_TW
dc.titleConstruct Strongly Regular Graphs from D-boundeden_US
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
Appears in Collections:Thesis


Files in This Item:

  1. 254101.pdf

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.