Full metadata record
DC FieldValueLanguage
dc.contributor.author林凡軒en_US
dc.contributor.authorLin, Fan-Hsuanen_US
dc.contributor.author翁志文en_US
dc.contributor.authorWeng, Chih-Wenen_US
dc.date.accessioned2014-12-12T02:41:22Z-
dc.date.available2014-12-12T02:41:22Z-
dc.date.issued2013en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT070152227en_US
dc.identifier.urihttp://hdl.handle.net/11536/74756-
dc.description.abstract令G=(V,E)是一個點集V和邊集E的簡單連通圖。我們有一個新的拉普拉斯譜半徑的極值上界,而這個上界改進了一些已知的結果。zh_TW
dc.description.abstractLet G=(V,E) be a simple connected graph with the vertex set V and the edge set E. We have a new sharp bound for the Laplacian spectral radius of $G$, which improves some known upper bounds.en_US
dc.language.isoen_USen_US
dc.subjectzh_TW
dc.subject拉普拉斯矩陣zh_TW
dc.subject拉普拉斯譜半徑zh_TW
dc.subjectGraphen_US
dc.subjectLaplacian matrixen_US
dc.subjectLaplacian spectral radiusen_US
dc.title圖的拉普拉斯譜半徑zh_TW
dc.titleThe Laplacian Spectral Radius of a Graphen_US
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
Appears in Collections:Thesis