International Journal of Mathematics Trends and Technology
Volume 56 | Number 2 | Year 2018 | Article Id. IJMTT-V56P517 | DOI : https://doi.org/10.14445/22315373/IJMTT-V56P517
Binary codes from graphs have been studied widely since 1960’s. Matrices associated with the graphs were considered as a good tool to construct codes from graphs. Incidence matrix, Adjacency matrix, cut set matrix, circuit matrix etc. were widely used to construct codes with desirable properties. Here we introduce a new binary code –the vertex code 𝐶 from a given graph 𝐺, depending on the degree of the vertices of 𝐺, in such a way that the vertex polynomial of 𝐺 is same as the weight enumerator of 𝐶.
[1] F. J. Macwilliams , N. A. J. Sloane, ‘The Theory of Error Correcting Codes’, Elsevier Science Publishers B.V, P.O. Box 1991, 1000BZ Amsterdam, The Netherlands.
[2] S. Sedghi, N.Shobe, M.A.Salahshoor, ‘The Polynomials of a Graph’, Iranian Journal of Mathematical Sciences and Informatics, Vol. 3, No. 2, (2008)pp 55-67.
[3] G. Suresh Singh, ‘Graph Theory’, PHI Learning Private Limited, New Delhi, 2010.
N. Suresh Babu, G. Suresh Singh, Sreedevi S.L., "Graphs and Codes," International Journal of Mathematics Trends and Technology (IJMTT), vol. 56, no. 2, pp. 120-128, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V56P517
PDF 
Abstract 
Keywords 
References 
Citation