Hamming Index of Class of Graphs

Authors

  • Harishchandra S. Ramane Department of Mathematics, Gogte Institute of Technology, Belgaum 590008, India Author
  • Asha B. Ganagi Department of Mathematics, Gogte Institute of Technology, Belgaum 590008, India Author

Keywords:

Hamming distance, Hamming index. Adjacency matrix, Mathematics Subject Classification: 05C99

Abstract

Let A(G) be the adjacency matrix of a graph G. The rows of A(G) corresponding to a vertex v of G, denoted by s(v) is the string which belongs toZn, a set of n-tuples. The Hamming distance between the vertices u and v is the number of 2 positions in which s(u) and s(v) differ. The Hamming index of a graph G is the sum of the Hamming distances between all pairs of vertices of G. In this paper we obtain the Hamming index of certain class of graphs.

References

Downloads

Published

2013-09-30

Issue

Special Issue-1 (Sep 2013)

Section

Articles

How to Cite

Hamming Index of Class of Graphs. (2013). International Journal of Current Engineering and Technology, 1(1.Special Issue), 205-208. https://ijcet.evegenis.org/index.php/ijcet/article/view/3830