Home  /  Proyecciones  /  Vol: 38 Núm: 5 Par: 0 (2019)  /  Article
ARTICLE
TITLE

On star coloring of degree splitting of join graphs

SUMMARY

A star coloring of a graph G is a proper vertex coloring in which every path on four vertices in G is not bicolored. The star chromatic number ?s (G) of G is the least number of colors needed to star color G. In this paper, we have generalized the star chromatic number of degree splitting of join of any two graph G and H denoted by G + H, where G is a path graph and H is any simple graph. Also, we determine the star chromatic number for degree splitting of join of path graph G of order m with path Pn, complete graph Kn and cyclevgraph Cn.

 Articles related

Jayson De Luna Tolentino,Reginaldo M. Marcelo,Mark Anthony C. Tolentino    

Let k = 2 be an integer and G be a connected graph of order at least 3. A twin k-edge coloring of G is a proper edge coloring of G that uses colors from Zk and that induces a proper vertex color... see more


Anie Lusiani,Edy Tri Baskoro,Suhadi Wido Saputro    

For simple graphs G and H the size multipartite Ramsey number mj(G,H) is the smallest natural number t such that any arbitrary red-blue coloring on the edges of Kjxt contains a red G or a blue H as a subgraph. We studied the size tripartite Ramsey number... see more


Anie Lusiani,Edy Tri Baskoro,Suhadi Wido Saputro    

Burger and Vuuren defined the size multipartite Ramsey number for a pair of complete, balanced, multipartite graphs mj(Kaxb,Kcxd), for natural numbers a,b,c,d and j, where a,c >= 2, in 2004. They have also determined the necessary and sufficient condi... see more


Asmiati Asmiati,H. Assiyatun,E. T. Baskoro    

Let G be a connected graph and c a proper coloring of G . For i ƒ­1,2,ƒ»,k define the color class i C as the set of vertices receiving color i . The color code c (v) „¨ of a vertex v in G is the ordered k -tuple 1 ( ( , ), , ( , )) k d v C ƒ» d v C where... see more


K. Kaliraj,V. Kowsalya,Vernold Vivin    

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph µ(G), we now call the Mycielskian of G, which has the same clique number as G and whose c... see more