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 the paper, we extend known results concerning crossing numbers of join products of small graphs of order six with discrete graphs. The crossing number of the join productG *  +  D nfor the graphG *on six vertices consists of one vertex which is adjacent with three non-consecutive vertices of the 5-cycle. The proofs were based on the idea of establishing minimum values of crossings between two different subgraphs that cross the edges of the graphG *exactly once. These minimum symmetrical values are described in the individual symmetric tables.

On the Crossing Numbers of the Joining of a Specific Graph on Six Vertices with the Discrete Graph