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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let c be a k-coloring of a connected graph G and let pi={C1,C2,...,Ck} be the partition of V(G) induced by c. For every vertex v of G, let c_pi(v) be the coordinate of v relative to pi, that is c_pi(v)=(d(v,C1 ),d(v,C2 ),...,d(v,Ck )), where d(v,Ci )=min{d(v,x)|x in Ci }. If every two vertices of G have different coordinates relative to pi, then c is said to be a locating k-coloring of G. The locating-chromatic number of G, denoted by chi_L (G), is the least k such that there exists a locating k-coloring of G. In this paper, we determine the locating-chromatic numbers of some subdivisions of the friendship graph Fr_t, that is the graph obtained by joining t copies of 3-cycle with a common vertex, and we give lower bounds to the locating-chromatic numbers of few other subdivisions of Fr_t.

On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph