The complexity of graph polynomials
<p>This thesis examines graph polynomials and particularly their complexity. We give short proofs of two results from Gessel and Sagan (1996) which present new evaluations of the Tutte polynomial concerning orientations. A theorem of Massey et al (1997) gives an expression concerning the avera...
主要な著者: | Noble, S, Steven Noble |
---|---|
その他の著者: | Welsh, D |
フォーマット: | 学位論文 |
言語: | English |
出版事項: |
1997
|
主題: |
類似資料
-
On Weakly Distinguishing Graph Polynomials
著者:: Johann A. Makowsky, 等
出版事項: (2019-04-01) -
Zero-patterns of polynomials and Newton polytopes
著者:: Lauder, A
出版事項: (2003) -
Trees and graphs: congestion, polynomials and reconstruction
著者:: Law, H
出版事項: (2011) -
Several Roman domination graph invariants on Kneser graphs
著者:: Tatjana Zec, 等
出版事項: (2023-05-01) -
Colourings of random graphs
著者:: Heckel, A
出版事項: (2016)