### 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 language | English |
---|---|

Pages (from-to) | 189-198 |

Number of pages | 10 |

Journal | Graphs and Combinatorics |

Volume | 12 |

Issue number | 1 |

Publication status | Published - 1996 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)
- Discrete Mathematics and Combinatorics

### Cite this

*Graphs and Combinatorics*,

*12*(1), 189-198.

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

Research output: Contribution to journal › Article

*Graphs and Combinatorics*, vol. 12, no. 1, pp. 189-198.

}

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

VL - 12

SP - 189

EP - 198

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -