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 simple finite connected graph $G$, let $diam(G)$ and $d_{G}(u,v)$denote the diameter of $G$ and distance between $u$ and $v$ in $G$,respectively. A radio labeling of a graph $G$ is a mapping $f$ : $V(G)\rightarrow \{0, 1, 2,...\}$ such that $|f(u)-f(v)| \geq diam(G) + 1 -d_{G}(u,v)$ holds for every pair of distinct vertices $u,v$ of $G$. The radionumber $rn(G)$ of $G$ is the smallest number $k$ such that $G$ has radiolabeling $f$ with max$\{f(v):v \in V(G)\}$ = $k$. Bantva et al. gave a lowerbound for the radio number of trees in [Lemma 3.1, Discrete AppliedMath.,217(2017),110-122] and, a necessary and sufficient condition to achievethis lower bound in [Theorem 3.2, Discrete Applied Math.,217(2017),110-122].Denote the lower bound for the radio number of trees given in [Lemma 3.1,Discrete Applied Math.,217(2017),110-122] by $lb(T)$. A tree $T$ is called alower bound tree for the radio number if $rn(T)$ = $lb(T)$. In this paper, weconstruct some large lower bound trees for the radio number using known lowerbound trees.

Some techniques to find large lower bound trees for the radio number