Monotonic Star Decomposition of Jump Graph of Cycles and Even Decomposition of Jump Graph of Complete Bipartite Graphs.

The Jump graph J(G) of a graph G is the graph whose vertices are edges of G and two vertices of J(G) are adjacent if and only if they are not adjacent in G. Equivalently complement of line graph L(G) is the Jump graph J(G) of G. In this paper, we give characterization for the Jump graph of cycles into Monotonic star decomposition. Also we give characterization for the Jump graph of complete bipartite graphs into even decomposition. [ABSTRACT FROM AUTHOR]