Codes from graphs related to the categorical product of triangular graphs and Kn

For any prime p and n >= 3, we examine p-ary linear codes generated by incidence matrices of two classes of graphs, H-n and Gamma(n) where Hn-1 is an induced subgraph of Gamma(n).Gamma(n) is a subgraph of the union of the categorical product of triangular graphs T-n and complete graphs K-n, and complements of triangular graphs (T) over bar (n) and K-n, where the union of graphs is as defined in [4]. For the codes of H-n, we exhibit permutation decoding sets of order n for full error correction. Their size is only twice the lower bound due to Gordon [7]. We also consider partial permutation decoding for the binary codes from Gamma(n)