We introduce the generator matrix of coding in a complete graph. This code is found to possess properties which are cyclic, MDS and perfect.

complete graph, codes

Received: February 12, 2024; Revised: February 20, 2024; Accepted: April 3, 2024; Published: May 11, 2024

How to cite this article: Hend Elmorsy and Amani Alkathiry, On codes in a complete graph, Advances and Applications in Discrete Mathematics 41(4) (2024), 325-329. https://doi.org/10.17654/0974165824023

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References
[1] A. Rosa, On certain valuations of vertices of a graph, Theory of Graphs, Internat. Sympos., Rome, 1966, Gordon & Breach, New York, 1967, pp. 349-355.
[2] J. Baskar Babujee and S. Babitha, Encrypting and decrypting number using labeled graphs, European Journal of Scientific Research 75(1) (2012), 14-24.
[3] J. Baskar Babujee, On graph coding, The Mathematics Education 39 (2005), 138-141.
[4] J. A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. (2016), 6.
[5] Y.-Z. Fan, W.-X. Du and C.-H. Dong, The Nullity of Bicyclic Signed Graphs, School of Mathematical Sciences, Anhui University, 2012.
[6] W. Fish, J. D. Key and E. Mwambene, Binary codes of line graphs from the n cube, J. Symbolic Comput. 45 (2010), 800-812.
[7] A. Kaya and B. Yildiz, Constructing formally self-dual codes block from block  circulant matrices, Math. Commun. 24 (2019), 91-105.
[8] J. D. Key, J. Moori and B. G. Rodrigues, Codes associated with triangular graphs, and permutation decoding, Int. J. Inform. Coding Theory 1 (2010), 334-349.