On distance and strong metric dimension of the modular product
From MaRDI portal
Publication:6661081
DOI10.1007/S40840-024-01800-6MaRDI QIDQ6661081
Iztok Peterin, Cong X. Kang, Eunjeong Yi, Aleksander Kelenc
Publication date: 10 January 2025
Published in: (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Closed formulae for the strong metric dimension of lexicographic product graphs
- \(L(2,1)\)-labelings on the modular product of two graphs
- On the strong metric dimension of Cartesian and direct products of graphs
- Resolvability and strong resolvability in the direct product of graphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Finding the prime factors of strong direct product graphs in polynomial time
- Recognizing Cartesian products in linear time
- The strong metric dimension of graphs and digraphs
- Associative products of graphs
- Factoring cardinal product graphs in polynomial time
- On the strong metric dimension of the strong products of graphs
- Erratum to ``On the strong metric dimension of the strong products of graphs
- Counterexamples to Hedetniemi's conjecture
- The Fractional Strong Metric Dimension of Graphs
- Introduction to Random Graphs
- Vizing's conjecture: a survey and recent results
- On Cartesian skeletons of graphs
- On Metric Generators of Graphs
- Distance formula for direct-co-direct product in the case of disconnected factors
- The simultaneous fractional dimension of graph families
- On some metric properties of direct-co-direct product
This page was built for publication: On distance and strong metric dimension of the modular product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661081)
