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

Two signed graphs are called switching isomorphic if one of them isisomorphic to a switching equivalent of the other. To determine the number ofswitching non-isomorphic signed graphs on a specific graph, we will establish amethod based on the action of its automorphism group. As an application andcomputational results, we classify all the switching non-isomorphic signedgraphs arising from the complete graph K5 and the generalized Petersen graphGP(7; 2). Moreover, some results on the automorphism groups of the targetsigned graphs are obtained.

Concerning Some Properties of Signed Graphs Associated With Specific Graphs