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 graph $G=(V,E)$ admits an $H$-covering if every edge in $E$ iscontained in a subgraph $H'=(V',E')$ of $G$ which is isomorphic to $H$. In thiscase we say that $G$ is $H$-supermagic if there is a bijection $f:V\cupE\to\{1,\ldots\lvert V\rvert+\lvert E\rvert\}$ such that$f(V)=\{1,\ldots,\lvert V\rvert\}$ and $\sum_{v\in V(H')}f(v)+\sum_{e\inE(H')}f(e)$ is constant over all subgraphs $H'$ of $G$ which are isomorphic to$H$. In this paper, we show that for odd $n$ and arbitrary $k$, the firecracker$F_{k,n}$ is $F_{2,n}$-supermagic, the banana tree $B_{k,n}$ is$B_{1,n}$-supermagic and the flower $F_n$ is $C_3$-supermagic.

$H$-supermagic labelings for firecrackers, banana trees and flowers