Graphs with distinguishing sets of size k
The size of a resolving set R of a non-trivial connected graph Γ of order n ≥ 2 is the number of edges in the induced subgraph <R>.The minimum cardinality of a resolving set of size k of graph Γ is called the metric dimension of size k, denoted by β(k)(Γ). We study the existence of resolving sets of...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Elsevier
2024-01-01
|
| Col·lecció: | Kuwait Journal of Science |
| Matèries: | |
| Accés en línia: | https://www.sciencedirect.com/science/article/pii/S2307410823002146 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|