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 graph G, its partially square graph G∗ is a graph obtained by adding an edge (u, v) for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition NG(x) ⊆ NG[u] ∪ NG[v], where NG[x] = NG(x) ∪ {x}. In the case where G is a claw-free graph, G∗ is equal to G. We define σ◦ t = min{ ∑ x∈S dG(x) : S is an independent set in G ∗ and |S| = t}. We give for hamiltonicity and circumference new sufficient conditions depending on σ◦ and we improve some known results.

Remarks on Partially Square Graphs, Hamiltonicity and Circumference