Cargando…
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:...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Elsevier
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7093810/ https://www.ncbi.nlm.nih.gov/pubmed/32226834 http://dx.doi.org/10.1016/j.heliyon.2020.e03633 |