強正則圖之研究

Full metadata record

DC Field	Value	Language
dc.contributor.author	尤貴弘	en_US
dc.contributor.author	Kuei-Hong You	en_US
dc.contributor.author	黃大原	en_US
dc.contributor.author	Tayuan Huang	en_US
dc.date.accessioned	2014-12-12T02:03:40Z	-
dc.date.available	2014-12-12T02:03:40Z	-
dc.date.issued	2003	en_US
dc.identifier.uri	http://140.113.39.130/cdrfb3/record/nctu/#GT009122529	en_US
dc.identifier.uri	http://hdl.handle.net/11536/52435	-
dc.description.abstract	Friendship定理說明當一個連通圖形滿足任兩點恰有一共同鄰點時，除了三個點的完全圖之外，此圖必不為正則圖。也就是說所有c=a=1 的強正則圖只有K3一個。在這篇文章中，我們從λ的分解來討論一些c=a>1 時的正則圖存在的必要條件，並且討論如Ramanujan圖及Symplectic圖等屬於該類圖形的一些性質。除此之外，文章中亦整理了一些c-a值不大的正則圖。	zh_TW
dc.description.abstract	The friend theorem excludes all strongly regular graphs with c-a=1 except K3. In this thesis, we study some necessary conditions for strongly regular graphs with c-a > 1 based on the decompositions of a, including the families of Ramanujan graphs and symplectic graphs as examples. A survey of strongly regular graphs with small value of c-a were also given in this thesis.	en_US
dc.language.iso	en_US	en_US
dc.subject	強正則圖	zh_TW
dc.subject	Strongly Regular Graph	en_US
dc.title	強正則圖之研究	zh_TW
dc.title	A Study of Strongly Regular Graph SRG(v, k, a, c) based on c-a	en_US
dc.type	Thesis	en_US
dc.contributor.department	應用數學系所	zh_TW
Appears in Collections:	Thesis

Files in This Item:

252901.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.