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

The edge-connectivity of a graph is the minimum number of edges whosedeletion disconnects the graph. Let $\Delta(G)$ the maximum degree of a graph$G$ and let $\rho(G)$ be the spectral radius of $G$. In this article we presenta lower bound for $\Delta(G)-\rho(G)$ in terms of the edge connectivity of $G$,where $G$ is a nonregular distance-hereditary graph. We also prove that$\rho(G)$ reaches the maximum at a unique graph in $\mathcal G$, when $\vertV(G)\vert = n$, and $\mathcal G$ either is in the class of graphs with boundedtree-width or is in the class of block graphs with prescribed independencenumber.

On the spectral radius of graphs: nonregular distance-hereditary graphs  with given edge-connectivity, graphs with tree-width $k$ and block graphs  with prescribed independence number $\alpha$