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/

Zendy Plus

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

Zendy Tools

Zendy Open

We show that, in the graph spectrum of the normalized graph Laplacian ontrees, the eigenvalue 1 and eigenvalues near 1 are strongly related to minimumvertex covers.  In particular, for the eigenvalue 1, its multiplicity is related to the sizeof a minimum vertex cover, and zero entries of its eigenvectors correspond tovertices in minimum vertex covers; while for eigenvalues near 1, their distanceto 1 can be estimated from minimum vertex covers; and for the largesteigenvalue smaller than 1, the sign graphs of its eigenvectors take vertices ina minimum vertex cover as representatives.

Minimum vertex covers and the spectrum of the normalized Laplacian on trees