Switching classes of directed graphs and H-equivalent matrices (Q1086582)

The paper defines the switching classes of digraphs on n vertices, and shows that they are a generalization of both Van Lint and Seidel's switching classes of graphs and Cameron's switching classes of tournaments. The results are used to derive a formula for the number of H-equivalence classes of matrices of fixed size whose entries chosen from \(\{\) 1,\(-1,2,-2,...,k,-k\}\). Also, the isomorphisms between switching classes of digraphs are defined, which are used to obtain a formula for the number of isomorphism types of switching classes of digraphs defined on a fixed subset of pairs of distinct vertices.