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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The distinguishing index $D'(G)$ of a graph $G$ is the least number of colorsnecessary to obtain an edge coloring of $G$ that is preserved only by thetrivial automorphism. We show that if $G$ is a connected $\alpha$-regular graphfor some infinite cardinal $\alpha$ then $D'(G) \le 2$, proving a conjecture ofLehner, Pil\'{s}niak, and Stawiski. We also show that if $G$ is a graph withinfinite minimum degree and at most $2^\alpha$ vertices of degree $\alpha$ forevery infinite cardinal $\alpha$, then $D'(G) \le 3$. In particular, $D'(G) \le3$ if $G$ has infinite minimum degree and order at most $2^{\aleph_0}$.

The distinguishing index of graphs with infinite minimum degree