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

A function f is defined, mapping graphs with n vertices onto graphs with vertex set {1,...,n} . f(X) is isomorphic to X and X is isomorphic to Y iff f(X) &equil; f(Y). For each d, the restriction of f to graphs of valence d is computable in time O(n&tgr;(d)) for a suitable integer &tgr;(d). For d 3, the proof uses a recent result of L. Babai, P.J. Cameron and P.P. Pálfy on the order of primitive groups with bounded composition factors; for the trivalent case a more elementary proof is presented.

Normal forms for trivalent graphs and graphs of bounded valence