46
Views
1
CrossRef citations to date
0
Altmetric
Research Article

On mixed metric dimension in subdivision, middle, and total graphs

ORCID Icon, , & ORCID Icon
Pages 2517-2527 | Received 09 Jun 2022, Published online: 06 Mar 2023

References

  • M. Behzad and G. Chartrand, Total graphs and traversability, Proc. Edinburgh Math. Soc. 15 (1966/67), 117–120. doi: 10.1017/S0013091500011421
  • V. Filipović, A. Kartelj, and J. Kratica, Edge metric dimension of some generalized Petersen graphs, Results Math. 74 (2019), Paper No. 182. doi: 10.1007/s00025-019-1105-9
  • T. Hamada and I. Yoshimura, Traversability and connectivity of the middle graph of a graph, Discrete Math. 14 (1976), 247–255. doi: 10.1016/0012-365X(76)90037-6
  • F. Harary and R.A. Melter, On the metric dimension of a graph, Ars Combin. 2 (1976), 191–195.
  • M. Johnson, Structure-activity maps for visualizing the graph variables arising in drug design, J. Biopharm. Statist. 3(2) (1993), 203–236. doi: 10.1080/10543409308835060
  • A. Kelenc, D. Kuziak, A. Taranenko, and I.G. Yero, Mixed metric dimension of graphs, Appl. Math. Comput. 314 (2017), 429–438.
  • A. Kelenc, N. Tratnik, and I.G. Yero, Uniquely identifying the edges of a graph: the edge metric dimension, Discrete Appl. Math. 251 (2018), 204–220. doi: 10.1016/j.dam.2018.05.052
  • D. Kuziak and I.G. Yero, Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results, arXiv:2107.04877 [math.CO] (10 Jul 2021).
  • J.H. Kwak and I. Sato, Zeta functions of line, middle, total graphs of a graph and their coverings, Linear Algebra Appl. 418 (2006), 234–256. doi: 10.1016/j.laa.2006.01.033
  • J.B. Liu, S. Kumar Sharma, V. Kumar Bhat, and H. Raza, Multiset and mixed metric dimension for starphene and zigzag-edge coronoid, Polycyclic Arom. Comp. 43(1) (2023), 190–204. doi: 10.1080/10406638.2021.2019066
  • R.A. Melter and I. Tomescu, Metric bases in digital geometry, Comput. Vision Graphics Image Process. 25(1) (1984), 113–121. doi: 10.1016/0734-189X(84)90051-3
  • M. Milivojević Danas, J. Kratica, A. Savić, and Z.Lj. Maksimović, Some new general lower bounds for mixed metric dimension of graphs, Filomat 35 (2021), 4275–4285. doi: 10.2298/FIL2113275M
  • J. Sedlar and R. Škrekovski, Mixed metric dimension of graphs with edge disjoint cycles, Discrete Appl. Math. 300 (2021), 1–8. doi: 10.1016/j.dam.2021.05.004
  • J. Sedlar and R. Škrekovski, Vertex and edge metric dimensions of unicyclic graphs, Discrete Appl. Math. 314 (2022), 81–92. doi: 10.1016/j.dam.2022.02.022
  • P.J. Slater, Leaves of trees, Cong. Numer. 14 (1975), 549–559.
  • M. Somodi, K. Burke, and J. Todd, On a construction using commuting regular graphs, Discrete Math. 340 (2017), 532–540. doi: 10.1016/j.disc.2016.07.018
  • B. Sooryanarayana, K. Shreedhar, and N. Narahari, On the metric dimension of the total graph of a graph, Notes Number Theory Discrete Math. 22(4) (2016), 82–95.
  • R.C. Tillquist, R. M. Frongillo, and M. E. Lladser, Getting the lay of the land in discrete space: A survey of metric dimension and its applications, arXiv:2104.07201 [math.CO] (15 Apr 2021).
  • R.C. Tillquist and M.E. Lladser, Low-dimensional representation of genomic sequences, J. Math. Biol. 79(1) (2019), 1–29. doi: 10.1007/s00285-019-01348-1
  • R. Trujillo-Rasúa and I.G. Yero, k-metric antidimension: A privacy measure for social graphs, Inform. Sci. 328 (2016), 403–417. doi: 10.1016/j.ins.2015.08.048

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.