Enumeration of Switching Non-isomorphic Signed Wheels

Abstract: Two signed graphs are called switching isomorphic to each other if one is isomorphic to a switching of the other. The wheel

W_{n}

is the join of the cycle

C_{n}

and a vertex. For

0 l e q p l e q n

,

p s i_{p} (n)

is defined to be the number of switching non-isomorphic signed

W_{n}

with exactly

p

negative edges on

C_{n}

. The number of switching non-isomorphic signed

W_{n}

is denoted by

p s i (n)

. In this paper, we compute the values of

p s i_{p} (n)

for

p = 0, 1, 2, 3, 4, n - 4, n - 3, n - 2, n - 1, n

and of

p s i (n)

for

n = 4, 5, ..., 10

. Our method of obtaining

p s i_{p} (n)

not only count the switching non-isomorphic signed wheels but also generates them.

This page was built for publication: Enumeration of Switching Non-isomorphic Signed Wheels