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

A graph in a certain graph class is called minimizing if the least eigenvalueof the adjacency matrix of the graph attains the minimum among all graphs inthat class. Bell {\it et al.} have characterized the minimizing graphs in theclass of connected graphs of order $n$ and size $m$, whose complements areeither disconnected or contain a clique of order at least $n/2$. In this paperwe discuss the minimizing graphs of a special class of graphs of order $n$whose complements are connected and contains exactly one cycle (namely the theclass $\mathscr {U}^{c}_{n}$ of graphs whose complements are unicyclic), andcharacterize the unique minimizing graph in $\mathscr {U}^{c}_{n}$ when $n \geq20$.

The least eigenvalue of graphs whose complements are unicyclic