Vertex-weighted $(k_{1},k_{2})$ $E$-torsion Graph of Quasi Self-dual Codes


  • Jupiter Pilongo University of Southern Mindanao
  • Leonard Mijares Paleta University of Southern Mindanao
  • Philip Lester P. Benjamin University of Southern Mindanao



Quasi self dual codes, QSD codes, vertex-weighted graphs, E-codes, torsion graphs


In this paper, we have introduced a graph $G_{EC}$ generated by type-$(k_{1},k_{2})$ $E$-codes which is $(k_{1},k_{2})$ $E$-torsion graph. The binary code words of the torsion code of $C$ are the set of vertices, and the edges are defined using the construction of $E$-codes. Also, we characterized the graph obtained when $k_{1}=0$ and $k_{2}=0$ and calculated the degrees of every vertex and the number of edges of $G_{EC}$. Moreover, we presented necessary and sufficient conditions for a vertex to be in the center of a graph given the property of the code word corresponding to the vertex. Finally, we represent every quasi-self dual codes of short length by defining the vertex-weighted $(k_{1},k_{2})$ $E$-torsion graph, where the weight of every vertex is the weight of the code word corresponding to the vertex.

Author Biography

  • Leonard Mijares Paleta, University of Southern Mindanao

    Mathematics Department Associate Professor






Nonlinear Analysis

How to Cite

Vertex-weighted $(k_{1},k_{2})$ $E$-torsion Graph of Quasi Self-dual Codes. (2024). European Journal of Pure and Applied Mathematics, 17(2), 1369-1384.

Similar Articles

1-10 of 253

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)