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...
Na minha lista:
| Principais autores: | , , , , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2022-12-01
|
| Serier: | Indonesian Journal of Combinatorics |
| Fag: | |
| Online adgang: | http://www.ijc.or.id/index.php/ijc/article/view/39 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|
