Decomposition of a complete bipartite multigraph into arbitrary cycle sizes

Abstract: In a graph

G

, let

m u_{G} (x y)

denote the number of edges between

x

and

y

in

G

. Let

l a m b d a K_{v, u}

be the graph

(V c u p U, E)

with

| V | = v

,

| U | = u

, and [ mu_G(xy)=�egin{cases} lambda &mbox{if

x i n U

and

y i n V

or if

x i n V

and

y i n U

}\ 0 &mbox{otherwise.} \ end{cases} ] Let

M

be a sequence of non-negative integers

m_{1}, m_{2}, l d o t s, m_{n}

. An

(M)

-cycle decomposition of a graph

G

is a partition of the edge set into cycles of lengths

m_{1}, m_{2}, l d o t s, m_{n}

. In this paper, we establish necessary and sufficient conditions for the existence of an

(M)

-cycle decomposition of

l a m b d a K_{v, u}

.

Recommendations

Cites Work

Cited In (8)

This page was built for publication: Decomposition of a complete bipartite multigraph into arbitrary cycle sizes