完整後設資料紀錄
DC 欄位語言
dc.contributor.author林鼎鈞en_US
dc.contributor.authorTing-Chun Linen_US
dc.contributor.author翁志文en_US
dc.contributor.authorChih-Wen Wengen_US
dc.date.accessioned2014-12-12T02:31:31Z-
dc.date.available2014-12-12T02:31:31Z-
dc.date.issued2002en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#NT910507017en_US
dc.identifier.urihttp://hdl.handle.net/11536/70950-
dc.description.abstract對於給定的一個簡單圖G,我們已知在圖G為森林的情況下,圖G的配對多項式恰等於特徵多項式,。但這性質不適用於任意圖。 在這篇論文中,我們給定一個公式,對於圖G的特徵多項式可以由一些圖G的子圖H的配對多項式做加減運算得到。zh_TW
dc.description.abstractLet 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.isozh_TWen_US
dc.subject特徵多項式zh_TW
dc.subject配對多項式zh_TW
dc.subjectcharacteristic polynomialen_US
dc.subjectmatchings plynomialen_US
dc.title圖的特徵多項式與配對多項式zh_TW
dc.titleCharacteristic Polynomial and Matchings Polynomila of a Graphen_US
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
顯示於類別:畢業論文