Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/6107Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ameen Shaman Ameen, Yee-Hock Peng | - |
| dc.contributor.author | Hai-xing Zhao | - |
| dc.date.accessioned | 2022-10-24T16:06:22Z | - |
| dc.date.available | 2022-10-24T16:06:22Z | - |
| dc.date.issued | 2013 | - |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/6107 | - |
| dc.description.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, we first characterize certain complete 6-partite graphs with 6n+1 vertices according to the number of 7-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or matching deleted. As a by-product, many new families of chromatically unique complete 6-partite graphs with certain star or matching deleted are obtained. | en_US |
| dc.title | Chromaticity of complete 6-partite graphs with certain star or matching deleted II | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | قسم الرياضيات التطبيقية | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.