Hamming index of graphs with respect to its incidence matrix

HIGHLIGHTS

• who: Mathematics Subject Classification and colleagues from the Department of, Karnatak University, Dharwad, India have published the research: Hamming index of graphs with respect to its incidence matrix, in the Journal: (JOURNAL) of 02/Nov/2017
• what: The Hamming distance between the strings generated by the incidence matrix of a graph is obtained.

SUMMARY

[5] For all x, y, z ∈ Zm 2, the following conditions are satisfied. (i) Hd (x, y)=Hd (y, x) (ii) Hd (x, y) ≥ 0 (iii) Hd (x, y)=0 if and only if x=y (iv . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or E-mail:

If you don't have an account, you can create one here.