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

The competition graph of a digraph D is a (simple undirected) graph which hasthe same vertex set as D and has an edge between x and y if and only if thereexists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graphG, G together with sufficiently many isolated vertices is the competition graphof some acyclic digraph. The competition number k(G) of G is the smallestnumber of such isolated vertices. In general, it is hard to compute thecompetition number k(G) for a graph G and it has been one of important researchproblems in the study of competition graphs to characterize a graph by itscompetition number. A hole of a graph is a cycle of length at least 4 as aninduced subgraph. It holds that the competition number of a graph cannot exceedone plus the number of its holes if G satisfies a certain condition. In thispaper, we show that the competition number of a graph with exactly h holes anytwo of which share at most one edge is at most h+1, which generalizes theexisting results on this subject.

The competition number of a graph in which any two holes share at most one edge