News Updates Wednesday 13th Dec 2017 :
  • Welcome to International Press Corporation, world's leading publishers, We have served more than 10000+ authors
  • Articles are invited in engineering, science, technology, management, industrial engg, biotechnology etc.
  • Paper submission last date of Nov/Dec 2017 extended to 15 Dec 2017, Submit online or at
  • Our journals are indexed in University of Regensburg Germany, Google Scholar, Cross Reference data bases
  • Applications for reviewers are invited and can be sent directly to concerned editor's mail

Hamming Index of Class of Graphs

Author : Harishchandra S. Ramane and Asha B. Ganagi

Pages : 205-208
Download PDF

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 to nZ2, a set of n-tuples. The Hamming distance between the vertices u and v is the number of 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.

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

Article published in the Proceedings of National Conference on ‘Women in Science & Engineering’ (NCWSE 2013), SDMCET Dharwad





Call for Papers
  1. IJCET- Nov/Dec-2017 Issue

    Submission Last Date extended to
    15 Dec 2017
  2. IJTT-Dec-2017
  3. IJAIE-Dec-2017
  4. IJCSB-Dec-2017
  • Inpressco Google Scholar
  • Inpressco Science Central
  • Inpressco Global impact factor
  • Inpressco aap

International Press corporation is licensed under a Creative Commons Attribution-Non Commercial NoDerivs 3.0 Unported License
©2010-2017 INPRESSCO® All Rights Reserved