Graphs whose mixed metric dimension is equal to their order

The mixed metric dimension $$\textrm{mdim}(G)$$ of a graph G is the cardinality smallest set vertices that (metrically) resolves each pair elements from $$V(G)\cup E(G)$$ . We say max-mdim if $$\textrm{mdim}(G) = n(G)$$ It proved with $$n(G)\ge 7$$ contains vertex degree at least 5. Using strong product graphs and amalgamations, large families are constructed. one universal determined. cut bounded above block computed.