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

Given a locally finite simple graph so that its degree is not bounded, everyself-adjoint realization of the adjacency matrix is unbounded from above. Inthis note we give an optimal condition to ensure it is also unbounded frombelow. We also consider the case of weighted graphs. We discuss the question ofself-adjoint extensions and prove an optimal criterium.

Unboundedness of adjacency matrices of locally finite graphs