Graphs whose mixed metric dimension is equal to their order

From MaRDI portal
Publication:6102426

DOI10.1007/S40314-023-02351-5zbMATH Open1524.05082arXiv2305.19620OpenAlexW4380267285MaRDI QIDQ6102426FDOQ6102426


Authors: Ali Ghalavand, Sandi Klavžar, M. Tavakoli Edit this on Wikidata


Publication date: 22 June 2023

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: The mixed metric dimension mmdim(G) of a graph G is the cardinality of a smallest set of vertices that (metrically) resolves each pair of elements from V(G)cupE(G). We say that G is a max-mdim graph if mmdim(G)=n(G). It is proved that a max-mdim graph G with n(G)ge7 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.


Full work available at URL: https://arxiv.org/abs/2305.19620




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Graphs whose mixed metric dimension is equal to their order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102426)