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

Decomposition into special substructures inheriting significant properties is an important method for the investigation of some mathematical structures. A  total dominator coloring  (briefly, a TDC) of a graph  G  is a proper coloring (i.e. a partition of the vertex set  V ( G ) into independent subsets named color classes) in which each vertex of the graph is adjacent to all of vertices of some color class. The  total dominator chromatic numberof  G  is the minimum number of color classes in a TDC of  G . In this paper among some other results and by using the existence of Steiner triple systems, we determine the total dominator chromatic number of the Kneser graphfor each

Total dominator chromatic number of Kneser graphs