𝔖 Bobbio Scriptorium
✦   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

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

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

Immanantal invariants of graphs
✍ Russell Merris πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 185 KB