Continuous monotonic decomposition of jump graph of paths and complete 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 if and only if they are not adjacent in G. In this article, we have given characterization for the Jump graph of paths into Continuous monotonic star decomposition. Also we have given characterization for the Jump graph of complete graphs into Continuous monotonic tree decomposition.