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

A subset of vertices is a {\it maximum independent set} if no two of thevertices are adjacent and the subset has maximum cardinality. A subset ofvertices is called a {\it maximum dissociation set} if it induces a subgraphwith vertex degree at most 1, and the subset has maximum cardinality. Zito [J.Graph Theory {\bf 15} (1991) 207--221] proved that the maximum number ofmaximum independent sets of a tree of order $n$ is $2^{\frac{n-3}{2}}$ if $n$is odd, and $2^{\frac{n-2}{2}}+1$ if $n$ is even and also characterized allextremal trees with the most maximum independent sets, which solved a questionposed by Wilf. Inspired by the results of Zito, in this paper, by establishingfour structure theorems and a result of $k$-K\"{o}nig-Egerv\'{a}ry graph, weshow that the maximum number of maximum dissociation sets in a tree of order$n$ is  \begin{center} $\left\{  \begin{array}{ll}  3^{\frac{n}{3}-1}+\frac{n}{3}+1, & \hbox{if $n\equiv0\pmod{3}$;}  3^{\frac{n-1}{3}-1}+1, & \hbox{if $n\equiv1\pmod{3}$;}  3^{\frac{n-2}{3}-1}, & \hbox{if $n\equiv2\pmod{3}$,}  \end{array} \right.$ \end{center} and also give complete structuraldescriptions of all extremal trees on which these maxima are achieved.

The maximum number of maximum dissociation sets in trees