Full metadata record
DC FieldValueLanguage
dc.contributor.author陳依凡en_US
dc.contributor.authorYi-Fan Chenen_US
dc.contributor.author傅恆霖en_US
dc.contributor.authorHung-Lin Fuen_US
dc.date.accessioned2014-12-12T02:45:39Z-
dc.date.available2014-12-12T02:45:39Z-
dc.date.issued2004en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT009222532en_US
dc.identifier.urihttp://hdl.handle.net/11536/76501-
dc.description.abstract令G為一個圖且A(G)為G的相鄰矩陣。G的特徵多項式記作PG(x),其定義為( xI - A(G) )該矩陣的特徵值,其中I是單位矩陣。而圖的相鄰矩陣所對應的特徵值視為該圖的特徵值。在本篇論文中,我們將討論二分圖其最大的特徵值。主要而言,對於某幾個類別的二分圖的最大特徵值給一個上界。zh_TW
dc.description.abstractLet G be a graph and A(G) be the adjacency matrix of G. The characcteristic polynomial of G, denoted by PG(x), is det ( xI - A(G ) ) where I is the identity matrix. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. In this thesis, we study the largest eigenvalue of bipartite graphs. Mainly, an upper bound for the largest eigenvalues of certain families of bipartite graphs is obtained.en_US
dc.language.isoen_USen_US
dc.subject圖的特徵植zh_TW
dc.subjecteigenvalues of a graphen_US
dc.title二分圖其特徵值的上界zh_TW
dc.titleOn The Largest Eigenvalues of Bipartite Graphsen_US
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
Appears in Collections:Thesis


Files in This Item:

  1. 253201.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.