Chromaticity of a family of 5-partite graphs
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{divides}. H~. G}. If [G]. = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain compl...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Bahrain
2014
|
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |
LEADER | 01512nam a2200205Ia 4500 | ||
---|---|---|---|
001 | 10.1016-j.jaubas.2013.05.003 | ||
008 | 220112s2014 CNT 000 0 und d | ||
020 | |a 18153852 (ISSN) | ||
245 | 1 | 0 | |a Chromaticity of a family of 5-partite graphs |
260 | 0 | |b University of Bahrain |c 2014 | |
856 | |z View Fulltext in Publisher |u https://doi.org/10.1016/j.jaubas.2013.05.003 | ||
856 | |z View in Scopus |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-84897574365&doi=10.1016%2fj.jaubas.2013.05.003&partnerID=40&md5=e8f2898134fe6f94e7a8c570b5e97320 | ||
520 | 3 | |a 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{divides}. 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 5. n 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. © 2013. | |
650 | 0 | 4 | |a Chromatic polynomial |
650 | 0 | 4 | |a Chromatic uniqueness |
650 | 0 | 4 | |a Chromatically closed |
700 | 1 | 0 | |a Hasni, R. |e author |
700 | 1 | 0 | |a Lau, G.C. |e author |
700 | 1 | 0 | |a Shaman, A. |e author |
773 | |t Journal of the Association of Arab Universities for Basic and Applied Sciences |