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

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 ( , ) i d v C is the distance of v to i C . If all distinct vertices of G have distinct color codes, then c is called a locating-coloring of G . The locating-chromatic number of graph G , denoted by ( ) L ƒO G is the smallest k such that G has a locating coloring with k colors. In this paper we discuss the locating-chromatic number of amalgamation of stars k ,m S . k ,m S is obtained from k copies of star 1,m K by identifying a leaf from each star. We also determine a sufficient condition for a connected subgraph k ,m H „~ S satisfying , ( ) ( ) L L k m ƒO H „T ƒO.

Locating-Chromatic Number of Amalgamation of Stars