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 with n vertices and mu(G) be the largest eigenvalue of theadjacency matrix of G. We study how large mu(G) can be when G does not containcycles and paths of specified order. In particular, we determine the maximumspectral radius of graphs without paths of given length, and give tight boundson the spectral radius of graphs without given even cycles. We also raise anumber of natural open problems.

The spectral radius of graphs without paths and cycles of specified length