| Autor: |
Ghalavand, Ali, Klavžar, Sandi, Tavakoli, Mostafa |
| Rok vydání: |
2023 |
| Předmět: |
|
| Druh dokumentu: |
Working Paper |
| Popis: |
The mixed metric dimension ${\rm mdim}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that (metrically) resolves each pair of elements from $V(G)\cup E(G)$. We say that $G$ is a max-mdim graph if ${\rm mdim}(G) = n(G)$. It is proved that a max-mdim graph $G$ with $n(G)\ge 7$ contains a vertex of degree at least $5$. Using the strong product of graphs and amalgamations large families of max-mdim graphs are constructed. The mixed metric dimension of graphs with at least one universal vertex is determined. The mixed metric dimension of graphs $G$ with cut vertices is bounded from the above and the mixed metric dimension of block graphs computed. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
