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

In this paper, we present a sharp upper and lower bounds for the signlessLaplacian spectral radius of graphs in terms of clique number. Moreover, theextremal graphs which attain the upper and lower bounds are characterized. Inaddition, these results disprove the two conjectures on the signless Laplacianspectral radius in [P. Hansen and C. Lucas, Bounds and conjectures for thesignless Laplacian index of graphs, Linear Algebra Appl., 432(2010) 3319-3336].

Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number