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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let G be a simple graph with n vertices, and let λn (G) be the least eigenvalue of G. The connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. In this paper, the first five unicyclic graphs on order n in terms of their smaller least eigenvalues are determined. Copyright © 2010 Guang-Hui Xu.

Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues