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

We consider undirected simple finite graphs. The sets of vertices and edgesof a graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. For a graph $G$,we denote by $\delta(G)$ and $\eta(G)$ the least degree of a vertex of $G$ andthe number of connected components of $G$, respectively. For a graph $G$ and anarbitrary subset $V_0\subseteq V(G)$ $G[V_0]$ denotes the subgraph of the graph$G$ induced by the subset $V_0$ of its vertices. An arbitrary nonempty finitesubset of consecutive integers is called an interval. A function$\varphi:E(G)\rightarrow \{1,2,\dots,|E(G)|\}$ is called an edge labeling ofthe graph $G$, if for arbitrary different edges $e'\in E(G)$ and $e''\in E(G)$,the inequality $\varphi(e')\neq \varphi(e'')$ holds. If $G$ is a graph, $x$ isits arbitrary vertex, and $\varphi$ is its arbitrary edge labeling, then theset $S_G(x,\varphi)\equiv\{\varphi(e)/ e\in E(G), e \textrm{is incident with}x$\} is called a spectrum of the vertex $x$ of the graph $G$ at its edgelabeling $\varphi$. If $G$ is a graph and $\varphi$ is its arbitrary edgelabeling, then $V_{int}(G,\varphi)\equiv\{x\in V(G)/\;S_G(x,\varphi)\textrm{isan interval}\}$. For an arbitrary $r$-regular graph $G$ with $r\geq2$ and itsarbitrary edge labeling $\varphi$, the inequality $$|V_{int}(G,\varphi)|\leq\bigg\lfloor\frac{3\cdot|V(G)|-2\cdot\eta(G[V_{int}(G,\varphi)])}{4}\bigg\rfloor.$$ is proved.

An inequality for the number of vertices with an interval spectrum in edge labelings of regular graphs