English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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. Let G = (V,E) be a graph with V = S1 [ S2 [ S3 [ . . . [ St [ T where each Si is a set of all vertices of the same degree with at least two elements and T =V (G) − St i=1 Si. The degree splitting graph DS (G) is obtained by adding vertices w1,w2, . . .wt and joining wi to each vertex of Si for 1 i t. The comb product between two graphs G and H, denoted by G ⊲ H, is a graph obtained by taking one copy of G and |V (G)| copies of H and grafting the ith copy of H at the vertex o to the ith vertex of G. In this paper, we give the exact value of star chromatic number of degree splitting of comb product of complete graph with complete graph, complete graph with path, complete graph with cycle, complete graph with star graph, cycle with complete graph, path with complete graph and cycle with path graph.

ON STAR COLORING OF DEGREE SPLITTING OF COMB PRODUCT GRAPHS