𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs determined by polynomial invariants

✍ Scribed by Marc Noy

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
287 KB
Volume
307
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

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 determines a graph and, in particular, whether one can ΓΏnd graphs that can be uniquely determined by a given polynomial. In this paper we survey known results in this area and, at the same time, we present some new results.

πŸ“œ SIMILAR VOLUMES

Polynomial invariants of graphs II
Polynomial invariants of graphs II
✍ Seiya Negami; Katsuhiro Ota πŸ“‚ Article πŸ“… 1996 πŸ› Springer Japan 🌐 English βš– 575 KB
A note on Negami's polynomial invariants
A note on Negami's polynomial invariants for graphs
✍ 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