Tripartite straight linked graphs as matrices producing polynomials and their triangular sequence: Matrix model (A120658 ): M(n,m,9)={{0, 1, 1, 1, 0, 0, 1, 0, 0}, {1, 0, 1, 0, 1, 0, 0, 1, 0}, {1, 1, 0, 0, 0, 1, 0, 0, 1}, {1, 0, 0, 0, 1, 1, 1, 0, 0}, {0, 1, 0, 1, 0, 1, 0, 1, 0}, {0, 0, 1, 1, 1, 0, 0, 0, 1}, {1, 0, 0, 1, 0, 0, 0, 1, 1}, {0, 1, 0, 0, 1, 0, 1, 0, 1}, {0, 0, 1, 0, 0, 1, 1, 1, 0}} This model is straight hyperconnections between 3 generalized K(n) complete graphs.

A123590

Tripartite straight linked graphs as matrices producing polynomials and their triangular sequence: Matrix model (A120658 ): M(n,m,9)={{0, 1, 1, 1, 0, 0, 1, 0, 0}, {1, 0, 1, 0, 1, 0, 0, 1, 0}, {1, 1, 0, 0, 0, 1, 0, 0, 1}, {1, 0, 0, 0, 1, 1, 1, 0, 0}, {0, 1, 0, 1, 0, 1, 0, 1, 0}, {0, 0, 1, 1, 1, 0, 0, 0, 1}, {1, 0, 0, 1, 0, 0, 0, 1, 1}, {0, 1, 0, 0, 1, 0, 1, 0, 1}, {0, 0, 1, 0, 0, 1, 1, 1, 0}} This model is straight hyperconnections between 3 generalized K(n) complete graphs.

Terms

    a(0) =1a(1) =1a(2) =-1a(3) =0a(4) =-2a(5) =1a(6) =2a(7) =3a(8) =0a(9) =-1a(10) =0a(11) =-4a(12) =-5a(13) =0a(14) =1a(15) =0a(16) =0a(17) =0a(18) =6a(19) =0a(20) =-1a(21) =0a(22) =0a(23) =12a(24) =-4a(25) =-9a(26) =0a(27) =1a(28) =0a(29) =12

External references