STAR-IN-COLORING OF COMPLETE BI-PARTITE GRAPHS, WHEEL GRAPHS AND PRISM GRAPHS
Journal: IMPACT : International Journal of Research in Engineering & Technology ( IMPACT : IJRET ) (Vol.2, No. 2)Publication Date: 2014-02-28
Authors : S. SUDHA; V. KANNIGA;
Page : 97-104
Keywords : Complete Bi-Partite Graph; Wheel Graph; Prism Graph; Star-in-Coloring;
Abstract
A k- coloring of a graph G=(V,E) is a mapping c:V (G)→{1,2,3,…} such that uv∈E(G)⇒c(u)≠c(v). In this paper, we have considered a complete bi-partite graph K_(m,n)for all m,n and proved that the star-in-chromatic number of K_(m,n) is either n + 1 if m ? n or m + 1 if n > m respectively. We have also found that the star-in-chromatic number of a wheel graph W_n has the lower bound and upper bound as 4 ? χ_si (W_n) ? 5. Further we have considered the prism graph Y_(n,m) and found that the star-in-chromatic number of the prism graph satisfies the relation 5 ?χ_si (Y_(n,m)) ? 6.
Other Latest Articles
- A REVIEW ON PROPERTIES OF SURGICAL SUTURES AND APPLICATIONS IN MEDICAL FIELD
- ROLE OF Ti & B IN MICROSTRUCTURE AND MECHANICAL PROPERTIES OF A 360 ALLOY
- FUNDAMENTAL NATURAL FREQUENCY FOR ISOTOPIC RECTANGULAR PLATE SIMPLY SUPPORTED ON THREE EDGES WITH ONE EDGE FREE OF SUPPORT (SSSF PLATE)
- A NOVEL MULTIMODAL BIOMETRIC SCHEME FOR PERSONAL AUTHENTICATION
- SCREENING PHYTOCHIMIQUE ET ACTIVITE ANTIBACTERIENNE DE L’HUILE ESSENTIELLE DE COTULA CINEREA (GARTOUFA) DANS LA REGION DE BECHAR
Last modified: 2014-03-13 21:39:25