QR Kodea

Hamming index of graphs with respect to its incidence matrix

Let <em>B</em>(<em>G</em>) be the incidence matrix of a graph <em>G</em>. The row in <em>B</em>(<em>G</em>)corresponding to a vertex <em>v</em>, denoted by <em>s</em>(<em>v</em>) is the string which belongs to ℤ<sup>m</sup><sub style="position: relative; left: -.9em;">2</sub>, a set of <em>m</em>-tu...

Deskribapen osoa

Gorde:
Egile Nagusiak: Harishchandra S. Ramane, Ishwar B. Baidari, Raju B. Jummannaver, Vinayak V. Manjalapur, Gouramma A. Gudodagi, Ashwini S. Yalnaik, Ajith S. Hanagawadimath
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: InaCombS; Universitas Jember; dan Universitas Indonesia 2022-12-01
Saila:Indonesian Journal of Combinatorics
Gaiak:
hamming distance
strings
incidence matrix
hamming index
Sarrera elektronikoa:http://www.ijc.or.id/index.php/ijc/article/view/39
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!

Antzeko izenburuak