Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 林鼎鈞 | en_US |
dc.contributor.author | Ting-Chun Lin | en_US |
dc.contributor.author | 翁志文 | en_US |
dc.contributor.author | Chih-Wen Weng | en_US |
dc.date.accessioned | 2014-12-12T02:31:31Z | - |
dc.date.available | 2014-12-12T02:31:31Z | - |
dc.date.issued | 2002 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#NT910507017 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/70950 | - |
dc.description.abstract | 對於給定的一個簡單圖G,我們已知在圖G為森林的情況下,圖G的配對多項式恰等於特徵多項式,。但這性質不適用於任意圖。 在這篇論文中,我們給定一個公式,對於圖G的特徵多項式可以由一些圖G的子圖H的配對多項式做加減運算得到。 | zh_TW |
dc.description.abstract | Let G be a simple graph. It is known that when graph G is a forest, the matching polynomial μ(G,x) is equal to the characteristic polynomial φ(G,x). But this is not true in general. In the thesis, we give a formula for φ(G,x) in terms of μ(H,x) for some subgraphs H of G. | en_US |
dc.language.iso | zh_TW | en_US |
dc.subject | 特徵多項式 | zh_TW |
dc.subject | 配對多項式 | zh_TW |
dc.subject | characteristic polynomial | en_US |
dc.subject | matchings plynomial | en_US |
dc.title | 圖的特徵多項式與配對多項式 | zh_TW |
dc.title | Characteristic Polynomial and Matchings Polynomila of a Graph | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 應用數學系所 | zh_TW |
Appears in Collections: | Thesis |