Carregant...
The dominant metric dimension of graphs
The G be a connected graph with vertex set [Formula: see text] and edge set [Formula: see text]. A subset [Formula: see text] is called a dominating set of G if for every vertex x in [Formula: see text] , there exists at least one vertex u in S such that x is adjacent to u. An ordered set [Formula:...
Guardat en:
| Publicat a: | Heliyon |
|---|---|
| Autors principals: | , , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Elsevier
2020
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7093810/ https://ncbi.nlm.nih.gov/pubmed/32226834 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.heliyon.2020.e03633 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|