Decomposition Of Jump Graph Of Cycles Into Paths, Cycles, Complete Bipartite Graphs And Banner Graphs

Abstract

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 iff they are not adjacent in G. In this paper, we present necessary and sufficient condition for the decomposition of jump graph of cycles into various graphs such as paths, cycles, stars and complete bipartite graphs. Also, we give necessary and sufficient condition for the decomposition of [J(C_n)-e] into banner graphs and cycles.