Lolyta Damora Simbolon


Suppose a finite simple graph is represented in the incidence matrix B. Each row in matrix B is a sequence of binary numbers with finite length. The Hamming distance of two vertices and of a simple graph G is defined as the number of positions of different digits. The Hamming index of a simple graph is the sum of the Hamming distances for all the different points in the graph. Suppose that each and is a simple graph whose degree is almost uniform. Using the Hamming Index, we obtain a formula for the Hamming Index on a graph in the form of corona multiplication and cartesian multiplication with each of the two graphs being of almost uniform degree.


graph, Hamming index, incidence matrix, multiplication graph


Ali, S., Farisah, L. dan Husna, W. 2019a. Indeks Hamming dari Graf Hasil Perkalian Kartesius pada Matriks Insidensi Titi-Sisi. Seminar Nasional Matematika dan Terapan, (1), 412-417.

Avgustinovich dan Fon-Der-Flaass. 2000. Cartesian Products of Graphs and Metric Spaces, Europ. J. Combinatoric, (21), 847-851.

Diestel. 2005. Graph Theory. New York: Springer-Verlag Heidelberg.

Dorbynin dan Kochetova. 1994. Degree Distance of A Graph: A Degree Analogue of The Wiener Index. Journal of Chemical Information and Computer Science, (34), 1087-1089.

Eliasi, M., Raeisi, G. dan Taeri, B. 2012. Wiener Index of Some Graph Operations. Discrete Applied Mathematics, (160), 1333-1344.

Frucht dan Harary. 1970. On the Corona of Two Graphs. Aequationes Mathematicae, (4), No. 3, 322-325.

Hamming, R. W. 1950.The Bell System Techcnical Journal.American Telephone and Telegraph Company, (29), No. 2, 147-160.

Kolman. B., Busby, R. dan Ross, S. 2005, Discrete Mathematical Structures, Prentice Hall of India, New Delhi.

Pasaribu, R., Mardiningsih dan Suwilo, S. 2018. Hamming Index of Thorn and Double Graphs, Bulletin of Mathematics, (10), No. 1, 25-32.

Paulraja dan Agnes. 2014. Degree Distance of Product Graphs.Discrete Mathematics, Algorithms and Applications, (6).

Pemmaraju dan Skiena. 2003. Computational Discrete Mathematics : Combinatorics and Graphs Theory with Mathematica. New York : Cambridge University Press.

Ramane, H. dan Ganagi, A. 2013. Hamming Index of Class of Graphs. International Journal of Current Engineering and Technology, 205 - 208.

Ravenkar, D., Ramane, H. dan Ganagi, A. 2012. On The Wiener Index of A Graph. J. Indones. Math. Soc., (18), 57-66.

Rawat dan Pradhan. 2017. Metric Dimension of Some Graphs under Join Operation. Global Journal of Pure and Applied Mathematics, 13, No. 7, 3331-3348.

Wiener. 1947. Structural Determination of Paraffin Boiling Points. J. Am. Chem. Soc., (69), No. 1, 17-20.

Yalnaik, A., Ramane, H. dan Gudodagi, G. 2016. Hamming Index Generated by The Incidence Matrix of Some Thorn Graphs. International Journal of Mathematical Archive, (7), No. 8, 7-12.



  • There are currently no refbacks.