An n-tuple (

) is symmetric, if

=

,

. Let

= {

;

{+,-},

=

,

} be the set of all symmetric n-tuples. A symmetric n-sigraph (symmetric n-marked graph) is an ordered pair

= (G,

) (

= (G,

)), where G = (V,E) is a graph called the underlying graph of

and

:E

is a function. The restricted super line graph of index r of a graph G, denoted by

(G). The vertices of

(G) are the r-subsets of E(G) and two vertices P =

and Q =

are adjacent if there exists exactly one pair of edges, say

and

, where

,

, that are adjacent edges in G. Analogously, one can define the restricted super line symmetric n-sigraph of index r of a symmetric n-sigraph

= (G,

) as a symmetric n-sigraph

(

) = (

,

'), where

is the underlying graph of

, where for any edge PQ in

,

=

. It is shown that for any symmetric n-sigraph

, its

is i-balanced and we offer a structural characterization of super line symmetric n-sigraphs of index r. Further, we characterize symmetric n-sigraphs

for which

~

and

, where ~ and

denotes switching equivalence and isomorphism and

and

are denotes the restricted super line symmetric n-sigraph of index r and super line symmetric n-sigraph of index r of

respectively.