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

For any real $\alpha \in [0,1]$, Nikiforov defined the $A_\alpha$-matrix of agraph $G$ as $A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G)$, where $A(G)$ and $D(G)$are the adjacency matrix and the diagonal matrix of vertex degrees of $G$,respectively. The largest eigenvalue of $A_\alpha(G)$ is called the$\alpha$-index or the $A_\alpha$-spectral radius of $G$. A graph is minimally$k$-connected if it is $k$-connected and deleting any arbitrary chosen edgealways leaves a graph which is not $k$-connected. In this paper, wecharacterize the extremal graphs with the maximum $\alpha$-index for $\alpha\in [\frac{1}{2},1)$ among all minimally 2-connected graphs with given order orsize, respectively.

On the $\alpha$-index of minimally 2-connected graphs with given order or size