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

In this paper, we show the values of crossing numbers for join products of graph G on five vertices with the discrete graph Dn and the path Pn on n vertices. The proof is done with the help of software. The software generates all cyclic permutations for a given number n. For cyclic permutations, P1 – Pm will create a graph in which to calculate the distances between all vertices of the graph. These distances are used in proof of crossing numbers of presented graphs.

ON THE CROSSING NUMBER OF THE JOIN OF FIVE VERTEX GRAPH WITH THE DISCRETE GRAPH Dn