A Vertex Code of Designed Distance dH and its Graph G

International Journal of Mathematics Trends and Technology (IJMTT)
© 2022 by IJMTT Journal
Volume-68 Issue-6
Year of Publication : 2022
Authors : Sreedevi S. L, N. Suresh Babu

How to Cite?

Sreedevi S. L, N. Suresh Babu, " A Vertex Code of Designed Distance dH and its Graph G ," International Journal of Mathematics Trends and Technology, vol. 68, no. 6, pp. 149-155, 2022. Crossref, https://doi.org/10.14445/22315373/IJMTT-V68I6P518

Matrices associated with the graphs were considered as a good tool to construct codes from graphs with desirable properties. We introduced a new binary code - the vertex code C from a given graph G, depending on the degree of the vertices of G, in such a way that the vertex polynomial of G is same as the weight enumerator of C in [3]. A detailed study on the properties of the vertex code was carried out in [4]. In this paper we revise the vertex code given there in with the purpose of enhancing the error correcting capability of the code and try to generalize the nature of the graph for a given code of specified size and distance.

Keywords : Graph, Vertex degree, Degree sequence, Arithmetic sequence, Error correcting codes, Vertex code.


[1] R. Balakrishnan, K. Ranganathan, A Textbook of Graph Theory, Springer (India) Private Limited, New Delhi 110001, (2008).
[2] R. S. Bapat, Graphs and Matrices, Springer, Co-publication with Hindustan Book Agency, New Delhi,2015.
[3] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Elsevier Science Publishing Co., 52 Vanderbilt Avenue, New York, NY 10017, (1976).
[4] P. J. Cameron and Van Lint, Designs, Graphs, Codes and their Links, London Mathematical Society, Student Texts 22, Cambridge University Press, (1991).
[5] Frank Harary and Gordon W. Wilcox, Boolean Operations on Graphs, Math. SCAND, 20 (1967) 41-51.
[6] Frank Harary, Graph Theory, © Narosa / Addison- Wesley, Indian Student Edition, (1990).
[7] D. G. Hoffman, D. A. Leonard, C. C. Lindner, K.T. Phelps, C. A. Rodger, J. R. Wall, Coding Theory- The Essentials, © Marcel Dekker, INC (1991).
[8] Jasan I. Brown, Richard J. Nowakowski, The Neighbourhood Polynomial of a Graph, Australian Journal of Combinatorics, 42(2008) 55-68.
[9] Kaveh, Optimal Analysis of Structures by concepts of Symmetry and Regularity, DOI 10.1007/978-3-7091-1565-7_2©SpringerVerlang Wein (2013).
[10] F. J. MacWilliams, NJA Sloane, The Theory of Error Correcting Codes, Elsevier Science Publishers, B.V., P. O. Box 1991, 1000BZ, Amsterdam, The Netherlands, (1988).
[11] Narsing Deo, Graph Theory - with Applications to Engineering and Computer Science, PHI, Pvt. Ltd, M-97, Cannaught Circus, NewDelhi 110001, (1997).
[12] Norman Biggs, Algebraic Graph Theory, Second edition, Cambridge University Press, (1993).
[13] San Ling, Chaoping Xing, Coding Theory; A First Course, Cambridge University Press, (2004).
[14] S. Sedghi, N. Shobe, M. A. Salahshoor, The Polynomials of a Graph, Iranian Journal of Mathematical Sciences and Informatics, 3(2) (2008) 55-67.
[15] N. Suresh Babu, G. Suresh Singh, Sreedevi S.L. Graphs and Codes, International Journal of Mathematics Trends and Technology, 56(2) (2018) 120- 128.
[16] N. Suresh Babu, Sreedevi S.L. Vertex Codes of Graphs, Far East Journal of Applied Mathematics, 100(3) (2018) 197- 215.
[17] G. Suresh Singh, Graph Theory, PHI, New Delhi, (2010).
[18] G. Suresh Singh, Sreedevi S. L., Vertex Polynomials Derived Through Various Graph Theoretical Operations, Indian Journal of Mathematics and Mathematical Sciences, 13(2) (2017) 357-367.
[19] Vladimir D. Tonchev, Error Correcting Codes from Graphs, Elsevier, Discrete Mathematics 257 (2002) 549-557