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

For a graph G=(V,E), a bijection f from V(G)∪E(G)→{1,2,…,|V(G)|+|E(G)|} is called (a,d)-edge-antimagic total ((a,d)-EAT) labeling of G if the edge-weights w(xy)=f(x)+f(y)+f(xy),xy∈E(G), form an arithmetic progression starting from a and having a common difference d, where a>0 and d≥0 are two fixed integers. An (a,d)-EAT labeling is called super (a,d)-EAT labeling if the vertices are labeled with the smallest possible numbers; that is, f(V)={1,2,…,|V(G)|}. In this paper, we study super (a,d)-EAT labeling of cycles with some pendant edges attached to different vertices of the cycle

journal of applied mathematics

On Super<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math>-Edge-Antimagic Total Labeling of Special Types of Crown Graphs

On Super(a,d)-Edge-Antimagic Total Labeling of Special Types of Crown Graphs