The (k,)-rainbow index for complete bipartite and multipartite graphs

Abstract: A tree in an edge-colored graph

G

is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers

k

,

e l l

with

k g e q 3

, the emph{

(k, e l l)

-rainbow index}

r x_{k, e l l} (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

e l l

internally disjoint rainbow trees connecting

S

. This concept was introduced by Chartrand et al., and there have been very few results about it. In this paper, we investigate the

(k, e l l)

-rainbow index for complete bipartite graphs and complete multipartite graphs. Some asymptotic values of their

(k, e l l)

-rainbow index are obtained.

Recommendations

Cites Work

Cited In (9)

This page was built for publication: The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs