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 simple $n$-vertex graph has a prime vertex labeling if the vertices can beinjectively labeled with the integers $1, 2, 3,\ldots, n$ such that adjacentvertices have relatively prime labels. We will present previously unknown primevertex labelings for new families of graphs, all of which are special cases ofSeoud and Youssef's conjecture that all unicyclic graphs have a prime labeling.

Prime Vertex Labelings Of Families Of Unicyclic Graphs