The s-shunt non-intersection graph of a graph

For an integer [Formula: see text], an [Formula: see text] in a graph [Formula: see text] is a sequence of [Formula: see text] vertices [Formula: see text] of [Formula: see text] such that for all [Formula: see text], [Formula: see text], and for all [Formula: see text], [Formula: see text]. A non-intersection graph of the set of all [Formula: see text]-arcs on distinct vertices of [Formula: see text], that can be shunted onto some other [Formula: see text]-arc on distinct vertices of [Formula: see text], has been introduced. Basic properties based on the order, size and the degree of an arbitrary vertex of the non-intersection graph of a graph defined are obtained. Additionally, certain properties pertaining to the connectedness of the same are discussed.