Hamming Matrix and Hamming Energy of a Graph

Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/22103

Full metadata record

DC Field	Value	Language
dc.contributor.author	Vučićević, Nemanja	-
dc.contributor.author	Redžepović, Izudin	-
dc.contributor.author	Stojanović, Nenad	-
dc.date.accessioned	2025-02-07T13:08:08Z	-
dc.date.available	2025-02-07T13:08:08Z	-
dc.date.issued	2025	-
dc.identifier.issn	03406253	en_US
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/22103	-
dc.description.abstract	Hamming distance is a highly valuable quantity in computer science. In this work, we establish the Hamming matrix H of a graph G, H(G). This is a square matrix, where the elements of the H(G) are Hamming distances. Also, we define the Hamming energy of a graph, HE(G), which is a sum of the absolute eigenvalues of H(G). Finally, we present some bounds on the HE(G) and its predictive potential.	en_US
dc.publisher	Faculty of Science & University of Kragujevac	en_US
dc.relation.ispartof	Match Communications in Mathematical and in Computer Chemistry	en_US
dc.title	Hamming Matrix and Hamming Energy of a Graph	en_US
dc.type	article	en_US
dc.identifier.doi	10.46793/match.93-3.713V	en_US
Appears in Collections:	Faculty of Science, Kragujevac

396

78

Files in This Item:

File	Description	Size	Format
HammingMatrixHammingEnergy.pdf		453.33 kB	Adobe PDF	View/Open

SCIDAR - A Digital Archive of the University of Kragujevac