Polynomial invariants of graphs II

Seiya Negami, Katsuhiro Ota

研究成果: Article

1 引用 (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.

元の言語English
ページ(範囲)189-198
ページ数10
ジャーナルGraphs and Combinatorics
12
発行部数2
出版物ステータスPublished - 1996 1 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

フィンガープリント Polynomial invariants of graphs II' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用