Polynomial invariants of graphs II

Seiya Negami, Katsuhiro Ota

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


Negami and Kawagoe has already defined a polynomial f̃(G) associated with each graph G as what discriminates graphs more finely than the polynomial f(G) defined by Negami and the Tutte polynomial. In this paper, we shall show that the polynomial f̃(G) includes potentially the generating function counting the independent sets and the degree sequence of a graph G, which cannot be recognized from f(G) in general, and discuss on f̃(T) of trees T with observations by computer experiments.

Original languageEnglish
Pages (from-to)189-198
Number of pages10
JournalGraphs and Combinatorics
Issue number2
Publication statusPublished - 1996 Jan 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Polynomial invariants of graphs II'. Together they form a unique fingerprint.

Cite this