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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Assume that $G$ is a finite group and let $a$ and $b$ be non-negativeintegers. We define an undirected graph $\Gamma_{a,b}(G)$ whose verticescorrespond to the elements of $G^a\cup G^b$ and in which two tuples$(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if and only $\langlex_1,\dots,x_a,y_1,\dots,y_b \rangle =G.$ Our aim is to estimate the genus, thethickness and the crossing number of the graph $\Gamma_{a,b}(G)$ when $a$ and$b$ are positive integers.

Genus, thickness and crossing number of graphs encoding the generating properties of finite groups