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

The distance Laplacian matrix of a connected graph  G  is defined as, where  Tr ( G ) is the diagonal matrix of the vertex transmissions in  G  and  D ( G ) is the distance matrix of  G . The largest eigenvalue ofis called the distance Laplacian spectral radius of  G . In this paper, we determine the graphs with the maximum distance Laplacian spectral radius and the minimum distance Laplacian spectral radius among all the bicyclic graphs with given order, respectively.

On the distance Laplacian spectral radius of bicyclic graphs