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 Q -index of a simple graph is the largest eigenvalue of its signless Laplacian. As for the adjacency spectrum, we will show that in the set of connected bipartite graphs with fixed order and size, the bipartite graphs with maximal Q -index are the double nested graphs. We provide a sequence of (in)equalities regarding the principal eigenvector of the signless Laplacian of double nested graphs and apply these results to obtain some lower and upper bounds for their Q -index. In the end, we give some computational results in order to compare these bounds.

Sharp spectral inequalities for connected bipartite graphs with maximal Q-index