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

A simple graph  G  = ( V ,  E ) admits an  H -covering, if every edge in  E ( G ) belongs to a subgraph of  G  isomorphic to  H . A graph  G  admitting an  H -covering is called an ( a ,  d )- H -antimagic if there exists a bijective function  f  :  V ( G ) ∪  E ( G ) → {1, 2, …, | V ( G )| + | E ( G )|} such that for all subgraphs  H ′ isomorphic to  H  the sums ∑  v ∈ V ( H ′)  f ( v ) + ∑  e ∈ E ( H ′)  f ( e ) form an arithmetic sequence { a ,  a  +  d , …,  a  + ( t  − 1) d }, where  a  &gt; 0 and  d  ≥ 0 are integers and  t  is the number of all subgraphs of  G  isomorphic to  H . Moreover, if the vertices are labeled with numbers 1, 2, …, | V ( G )| the graph is called super. In this paper we deal with super cycle-antimagicness of subdivided graphs. We also prove that the subdivided wheel admits an ( a ,  d )-cycle-antimagic labeling for some  d .

Super ( a , d )- H -antimagic labeling of subdivided graphs