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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The main aim of the paper is to give the crossing number of the join productG +  D nfor the disconnected graph G of order five consisting of one isolated vertex and of one vertex incident with some vertex of the three-cycle, andD nconsists of n isolated vertices. In the proofs, the idea of the new representation of the minimum numbers of crossings between two different subgraphs that do not cross the edges of the graph G by the graph of configurationsG Din the considered drawing D ofG +  D nwill be used. Finally, by adding some edges to the graph G, we are able to obtain the crossing numbers of the join product with the discrete graphD nand with the pathP non n vertices for three other graphs.

Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five