Note on the upper bound of the rainbow index of a graph

A path in an edge-colored graph $G$, where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the minimum number of colors that are needed to color the edges of $G$ such that there exists a rainbow path connecting every two vertices of $G$. Similarly, a tree in $G$ is a rainbow~tree if no two edges of it receive the same color. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow tree connecting $S$ for each $k$-subset $S$ of $V(G)$ is called the $k$-rainbow index of $G$, denoted by $rx_k(G)$, where $k$ is an integer such that $2\leq k\leq n$. Chakraborty et al. got the following result: For every $\epsilon> 0$, a connected graph with minimum degree at least $\epsilon n$ has bounded rainbow connection, where the bound depends only on $\epsilon$. Krivelevich and Yuster proved that if $G$ has $n$ vertices and the minimum degree $\delta(G)$ then $rc(G)<20n/\delta(G)$. This bound was later improved to $3n/(\delta(G)+1)+3$ by Chandran et al. Since $rc(G)=rx_2(G)$, a natural problem arises: for a general $k$ determining the true behavior of $rx_k(G)$ as a function of the minimum degree $\delta(G)$. In this paper, we give upper bounds of $rx_k(G)$ in terms of the minimum degree $\delta(G)$ in different ways, namely, via Szemer\'{e}di's Regularity Lemma, connected $2$-step dominating sets, connected $(k-1)$-dominating sets and $k$-dominating sets of $G$.Comment: 12 pages. arXiv admin note: text overlap with arXiv:0902.1255 by other author

The (k,ℓ)(k,\ell)-rainbow index of random graphs

A tree in an edge colored graph is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$, $\ell$ with $k\geq 3$, the \emph{$(k,\ell)$-rainbow index} $rx_{k,\ell}(G)$ of $G$ is the minimum number of colors needed in an edge-coloring of $G$ such that for any set $S$ of $k$ vertices of $G$, there exist $\ell$ internally disjoint rainbow trees connecting $S$. This concept was introduced by Chartrand et. al., and there have been very few related results about it. In this paper, We establish a sharp threshold function for $rx_{k,\ell}(G_{n,p})\leq k$ and $rx_{k,\ell}(G_{n,M})\leq k,$ respectively, where $G_{n,p}$ and $G_{n,M}$ are the usually defined random graphs.Comment: 7 pages. arXiv admin note: substantial text overlap with arXiv:1212.6845, arXiv:1310.278

An irrigated area map of the world (1999) derived from remote sensing

Remote sensing / Mapping / GIS / Irrigated sites / Estimation