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 size $m$, and let $\mathrm{mc}_{k}\left(G\right) $ be the maximum size of a $k$-cut of $G.$ It is shown that \[\mathrm{mc}_{k}\left( G\right) \leq\frac{k-1}{k}\left( m-\frac{\mu_{\min}\left( G\right) n}{2}\right) , \] where $\mu_{\min}\left( G\right) $ is thesmallest eigenvalue of the adjacency matrix of $G.$  An infinite class of graphs forcing equality in this bound is constructed.

Max k-cut and the smallest eigenvalue