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 well-known open problem in graph theory asks whether Stanley's chromaticsymmetric function, a generalization of the chromatic polynomial of a graph,distinguishes between any two non-isomorphic trees. Previous work has proventhe conjecture for a class of trees called spiders. This paper generalizes theclass of spiders to $n$-spiders, where normal spiders correspond to $n = 1$,and verifies the conjecture for $n = 2$.

A Few More Trees the Chromatic Symmetric Function Can Distinguish