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

A tree $T$, in an edge-colored graph $G$, is called {\em a rainbow tree} ifno two edges of $T$ are assigned the same color. A {\em $k$-rainbow coloring}of$G$ is an edge coloring of $G$ having the property that for every set $S$ of$k$ vertices of $G$, there exists a rainbow tree $T$ in $G$ such that$S\subseteq V(T)$. The minimum number of colors needed in a $k$-rainbowcoloring of $G$ is the {\em $k$-rainbow index of $G$}, denoted by $rx_k(G)$. Inthis paper, we consider 3-rainbow index $rx_3(G)$ of $G$. We first show thatfor connected graph $G$ with minimum degree $\delta(G)\geq 3$, the tight upperbound of $rx_3(G)$ is $rx_3(G[D])+4$, where $D$ is the connected 2-dominatingset of $G$. And then we determine a tight upper bound for $K_{s,t}(3\leq s\leqt)$ and a better bound for $(P_5,C_5)$-free graphs. Finally, we obtain a sharpbound for 3-rainbow index of general graphs.

Some upper bounds for 3-rainbow index of graphs