On the Uniqueness of Chromatic polynomial of Generalized wheel Graph |
Received:December 07, 1988 |
Key Words:
|
Fund Project: |
|
Hits: 2092 |
Download times: 1294 |
Abstract: |
In this paper it is proved that the generalized wheel graph θn,k is chromatically unique if k≥0 and n≥4 is even.Meainwhile, it is also proved that for a graph Gif and only if G Pλ(G)=λ…(λ-q 1)(λ-q)n-q is a q-tree on n vertices. |
Citation: |
DOI:10.3770/j.issn:1000-341X.1990.03.027 |
View Full Text View/Add Comment |