Searcharxiv⌕ Search

arXiv subjects

Mirjana Čangalović

Publications and source records attributed to Mirjana Čangalović.

4 recordsLinked to original sources
arXiv2026

The strong and doubly metric dimensions of Johnson and Kneser graphs

In this paper, the strong and doubly metric dimensions of Johnson and Kneser graphs are considered. The exact value of the strong metric dimension of Johnson graph $J_{n,k}$ is obtained using the well-known results from the literature. The strong metric dimension of Kneser graph $K_{n,k}$ has been obtained for $n \ge 3k-1$. Finally, it has been shown that the doubly metric dimensions of Johnson graph $J_{n,2}$ and Kneser graph $K_{n,2}$ are both $\lceil \frac{2n}{3} \rceil$.

math.CO↗
arXiv2025

Equidistant dimension of Johnson and Kneser graphs

In this paper the recently introduced concept of equidistant dimension $eqdim(G)$ of graph $G$ is considered. Useful property of distance-equalizer set of arbitrary graph $G$ has been established. For Johnson graphs $J_{n,2}$ and Kneser graphs $K_{n,2}$ exact values for $eqdim(J_{n,2})$ and $eqdim(K_{n,2})$ have been derived, while for Johnson graphs $J_{n,3}$ it is proved that $eqdim(J_{n,3}) \le n-2$. Finally, exact value of $eqdim(J_{2k,k})$ for odd $k$ has been presented.

math.CO↗
arXiv2023

A new lower bound for doubly metric dimension and related extremal differences

In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars, complete graphs and complete bipartite graph are obtained. The paper analyzes some tight bounds for the new invariant in general case. Also several extremal differences between some related invariants are determined.

math.CO↗