Polynomial invariants of graphs II

Seiya Negami, Katsuhiro Ota

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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
Volume12
Issue number1
Publication statusPublished - 1996

Fingerprint

Polynomial Invariants
Polynomials
Polynomial
Graph in graph theory
Tutte Polynomial
Degree Sequence
Computer Experiments
Independent Set
Generating Function
Counting
Experiments

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

Polynomial invariants of graphs II. / Negami, Seiya; Ota, Katsuhiro.

In: Graphs and Combinatorics, Vol. 12, No. 1, 1996, p. 189-198.

Research output: Contribution to journalArticle

Negami, S & Ota, K 1996, 'Polynomial invariants of graphs II', Graphs and Combinatorics, vol. 12, no. 1, pp. 189-198.
Negami, Seiya ; Ota, Katsuhiro. / Polynomial invariants of graphs II. In: Graphs and Combinatorics. 1996 ; Vol. 12, No. 1. pp. 189-198.
@article{12d81b195c064c918afe127ad1778bea,
title = "Polynomial invariants of graphs II",
abstract = "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.",
author = "Seiya Negami and Katsuhiro Ota",
year = "1996",
language = "English",
volume = "12",
pages = "189--198",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

TY - JOUR

T1 - Polynomial invariants of graphs II

AU - Negami, Seiya

AU - Ota, Katsuhiro

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0346129870&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346129870&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0346129870

VL - 12

SP - 189

EP - 198

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -