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 Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

The binding number of a graph G is defined as bind(G) = min |N(S)| |S| , S ∈ F (G) where F (G) = {S ⊆ V (G) : S = ∅ and N(S) = V (G)}. This paper provides some results on the binding numbers of corona and join of graphs and characterize them in terms of independent binding set. Mathematics Subject Classification: 05C69

Binding number of corona and join of graphs