On the metric dimension of Buckminsterfullerene-net graph
The metric dimension of an arbitrary connected graph <em>G</em>, denoted by dim(<em>G</em>), is the minimum cardinality of the resolving set <em>W</em> of <em>G</em>. An ordered set <em>W = </em>{<em>w<sub>1</sub>, w<sub>2</sub>,..., w<sub>k</sub></em>} is a resolving set of <em>G</em> if for all tw...
Guardat en:
| Autors principals: | , , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2023-12-01
|
| Col·lecció: | Indonesian Journal of Combinatorics |
| Matèries: | |
| Accés en línia: | http://www.ijc.or.id/index.php/ijc/article/view/188 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|