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. © 1989.
Publication Source (Journal or Book title)
Oxley, J. (1989). A note on Negami's polynomial invariants for graphs. Discrete Mathematics, 76 (3), 279-281. https://doi.org/10.1016/0012-365X(89)90326-9