標題: 由局限距離正則圖構造強正則圖的一種方法
Construct Strongly Regular Graphs from D-bounded
作者: 曾雅榕
Ya-JungTseng
翁志文
Chih-Wen Weng
應用數學系所
關鍵字: 距離正則圖;強正則圖;distance-regular graph;strongly regular graph
公開日期: 2007
摘要: 在數學的領域中,透過不同數學方法而得到相同的理論是常見 的。本論文的目的是探討,透過不同的兩個方法來証明強正則圖的參 數, 一個利用變數的計算(如定理7.6 所示),另一個是利用線性代數 的方法(如定理8.3). 結果顯示此強正則圖的參數呈現是一樣的。
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.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT009522541
http://hdl.handle.net/11536/38877
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.