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

For a graph $G$ and a positive integer $k$, a vertex labelling$f:V(G)\to\{1,2\ldots,k\}$ is said to be $k$-distinguishing if no non-trivialautomorphism of $G$ preserves the sets $f^{-1}(i)$ for each$i\in\{1,\ldots,k\}$. The distinguishing chromatic number of a graph $G$,denoted $\chi_D(G)$, is defined as the minimum $k$ such that there is a$k$-distinguishing labelling of $V(G)$ which is also a proper coloring of thevertices of $G$. In this paper, we prove the following theorem: Given$k\in\mathbb{N}$, there exists an infinite sequence of vertex-transitive graphs$G_{i}=(V_i,E_i)$ such that $\chi_D(G_i)>\chi(G_i)>k$ and$|\mathrm{Aut}(G_i)|=O_k(|V_i|)$, where $\mathrm{Aut}(G_i)$ denotes the fullautomorphism group of $G_i$. In particular, this answers a problem raised inthe paper $\chi_D(G)$, $|\mathrm{Aut}(G)|$ and a variant of the Motion lemma.

Vertex transitive graphs $G$ with $\chi_D(G) > \chi(G)$ and small automorphism group