dc.contributor.author |
Hasni, R. |
|
dc.contributor.author |
Shaman, A. |
|
dc.contributor.author |
Lau, G.C. |
|
dc.date.accessioned |
2018-07-29T06:57:16Z |
|
dc.date.available |
2018-07-29T06:57:16Z |
|
dc.date.issued |
2014 |
|
dc.identifier.issn |
1815-3852 |
|
dc.identifier.uri |
https://journal.uob.edu.bh:443/handle/123456789/1039 |
|
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 5-partite graphs G with 5n vertices according to the number of 6-independent partitions of G. Using these results, we investigate the chromaticity of G with certain stars or matching deleted parts . As a by-product, two new families of chromatically unique complete 5-partite graphs G with certain stars or matching deleted parts are obtained. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
University of Bahrain |
en_US |
dc.rights |
Attribution-NonCommercial-ShareAlike 4.0 International |
* |
dc.rights.uri |
http://creativecommons.org/licenses/by-nc-sa/4.0/ |
* |
dc.subject |
Chromatic polynomial |
|
dc.subject |
Chromatically closed |
|
dc.subject |
Chromatic uniqueness |
|
dc.title |
Chromaticity of a family of 5-partite graphs |
en_US |
dc.type |
Article |
en_US |
dc.identifier.doi |
http://dx.doi.org/10.1016/j.jaubas.2013.05.003 |
|
dc.source.title |
Arab Journal of Basic and Applied Sciences |
|
dc.abbreviatedsourcetitle |
AJBAS |
|