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 good deal of research has been done and published on coloring of thevertices of graphs for several years while studying of the excellent work ofthose maestros, we get inspire to work on the vertex coloring of graphs in caseof a particular triangular closed path structure what we achieve from the frontview of a pyramidal structure. From here we achieve a repetitive nature ofvertex coloring in case of odd and even number of horizontal lines within thistriangular structure. In order to apply this repetitive nature of vertexcoloring in case of a binary tree, we get a success in Krafts Inequality.Actually our work mainly deals with a particular triangular closed path vertexcoloring and repetition of the vertex coloring nature in case of the Kraftsinequality in the field of Information Theory and Coding.

Application of Vertex coloring in a particular triangular closed path structure and in Krafts inequality