Many polynomials have been deΓΏned associated to graphs, like the characteristic, matchings, chromatic and Tutte polynomials. Besides their intrinsic interest, they encode useful combinatorial information about the given graph. It is natural then to ask to what extent any of these polynomials determi
β¦ LIBER β¦
Polynomial invariants of graphs II
β Scribed by Seiya Negami; Katsuhiro Ota
- Publisher
- Springer Japan
- Year
- 1996
- Tongue
- English
- Weight
- 575 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Graphs determined by polynomial invarian
β
Marc Noy
π
Article
π
2003
π
Elsevier Science
π
English
β 287 KB
Polynomial invariants of graphs with sta
β
Seiya Negami; Kenichi Kawagoe
π
Article
π
1995
π
Elsevier Science
π
English
β 517 KB
A note on Negami's polynomial invariants
β
James G. Oxley
π
Article
π
1989
π
Elsevier Science
π
English
β 296 KB
Negami has introduced two polynomials for graphs and proved a number of properties of them. In this note, it is shown that these polynomials are intimately related to the well-known Tutte polynomial. This fact is used, together with a result of Brylawski, to answer a question of Negami. The matroid
A polynomial invariant of graphs in 3-ma
β
Abigail Thompson
π
Article
π
1992
π
Elsevier Science
π
English
β 613 KB
Immanantal invariants of graphs
β
Russell Merris
π
Article
π
2005
π
Elsevier Science
π
English
β 185 KB
Skeins associated with Homfly and Kauffm
β
K. Kawagoe
π
Article
π
2001
π
Springer
π
English
β 574 KB