Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/4164| Title: | A Remark on Chromatically Unique 5-Partite Graphs |
| Authors: | Roslan Hasni, Ameen Shaman Ameen |
| Keywords: | : Chromatic Polynomial Chromatically Closed Chromatic Uniqueness |
| Issue Date: | 2013 |
| Publisher: | Applied Mathematical Sciences |
| Abstract: | Let P(G, λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P(G, λ) = P(H, λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, two new families of chromatically unique complete 5-partite graphs G having 5n+4 vertices with certain star or matching deleted are obtained |
| URI: | http://localhost:8080/xmlui/handle/123456789/4164 |
| Appears in Collections: | قسم الرياضيات التطبيقية |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| A Remark on Chromatically Unique 5-Partite Graphs.pdf | 141.27 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.