Characteristic Polynomial and Matchings Polynomila of a Graph
碩士 === 國立交通大學 === 應用數學系 === 91 === 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 φ(...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/38262455106727913198 |