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

Let $G$ be a graph of order $n$ and let $k\in\{1,\ldots,n-1\}$. The $k$-tokengraph $F_k(G)$ of $G$, is the graph whose vertices are the $k$-subsets of$V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetricdifference is an edge of $G$. We study the independence and matching numbers of$F_k(G)$. We present a tight lower bound for the matching number of $F_k(G)$for the case in which $G$ has either a perfect matching or an almost perfectmatching. Also, we estimate the independence number for bipartite $k$-tokengraphs, and determine the exact value for some graphs.

Independence and matching numbers of some token graphs