標題: 圖的特徵多項式與配對多項式
Characteristic Polynomial and Matchings Polynomila of a Graph
作者: 林鼎鈞
Ting-Chun Lin
翁志文
Chih-Wen Weng
應用數學系所
關鍵字: 特徵多項式;配對多項式;characteristic polynomial;matchings plynomial
公開日期: 2002
摘要: 對於給定的一個簡單圖G,我們已知在圖G為森林的情況下,圖G的配對多項式恰等於特徵多項式,。但這性質不適用於任意圖。 在這篇論文中,我們給定一個公式,對於圖G的特徵多項式可以由一些圖G的子圖H的配對多項式做加減運算得到。
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.
URI: http://140.113.39.130/cdrfb3/record/nctu/#NT910507017
http://hdl.handle.net/11536/70950
顯示於類別:畢業論文