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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

S. -R. Kim and F. S. Roberts (2002) introduced the following conditions$C(p)$ and $C'(p)$ for digraphs as generalizations of the condition fordigraphs to be semiorders. The condition $C(p)$ (resp. $C'(p)$) is: For any set$S$ of $p$ vertices in $D$, there exists $x \in S$ such that $N^+_D(x)\subseteq N^+_D(y)$ (resp. $N^-_D(x) \subseteq N^-_D(y)$) for all $y \in S$,where $N^+_D(x)$ (resp. $N^-_D(x)$) is the set of out-neighbors (resp.in-neighbors) of $x$ in $D$. The competition graph of a digraph $D$ is the(simple undirected) graph which has the same vertex set as $D$ and has an edgebetween two distinct vertices $x$ and $y$ if $N^+_D(x) \cap N^+_D(y) \neq\emptyset$. Kim and Roberts characterized the competition graphs of digraphswhich satisfy Condition $C(p)$. The competition-common enemy graph of a digraph$D$ is the graph which has the same vertex set as $D$ and has an edge betweentwo distinct vertices $x$ and $y$ if it holds that both $N^+_D(x) \cap N^+_D(y)\neq \emptyset$ and $N^-_D(x) \cap N^-_D(y) \neq \emptyset$. In this note, wecharacterize the competition-common enemy graphs of digraphs satisfyingConditions $C(p)$ and $C'(p)$.

The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$