Advances and Applications in Discrete Mathematics
Volume 4, Issue 1, Pages 25 - 32
(July 2009)
|
|
SWITCHING EQUIVALENCE IN SYMMETRIC n-SIGRAPHS-I
P. Siva Kota Reddy (India) and B. Prashanth (India)
|
is symmetric, if
A symmetric n-sigraph
(symmetric n-marked graph) is an
ordered pair
where
is a graph called the underlying
graph of
and
is a function. Two symmetric n-sigraphs
and
are switching equivalent written
whenever there exists an n-marking
m
of
such that the symmetric n-sigraph
obtained by changing the n-tuple of
every edge uv of
by
is isomorphic to
In this paper, we characterize
symmetric n-sigraphs, iterated line
symmetric n-sigraphs
and complementary symmetric n-sigraphs
are switching equivalent.