References
- Foucaud F, Kao S, Klasing R, et al. Monitoring the edges of a graph using distances. Discrete Appl Math. 2022;319:424–438. doi: 10.1016/j.dam.2021.07.002
- Ji Z, Klasing R, Li W, et al. Erdos-Gallai-type problems for distance-edge-monitoring numbers. Discrete Appl Math. 2024;342:275–285. doi: 10.1016/j.dam.2023.09.020
- Yang C, Klasing R, Mao Y, et al. On the distance-edge-monitoring numbers of graphs. Discrete Appl Math. 2024;342:153–167. doi: 10.1016/j.dam.2023.09.012
- Yang C, Klasing R, He C, et al. Perturbation results for distance-edge-monitoring numbers. arXiv.2301.02507. 2023.
- Raza Z, Bataineh MS. The comparative analysis of metric and edge metric dimension of some subdivisions of the wheel graph. Asian Eur J Math. 2020;14(98):2150062.
- Baste J, Beggas F, Kheddouci H, et al. On the parameterized complexity of the Edge Monitoring problem. Inform Process Lett. 2017;121:39–44. doi: 10.1016/j.ipl.2017.01.008
- Naeem R, Imran M. On resolvability and exchange property in antiweb-wheels. Utilitas Math. 2017;104:187–200.
- Wallis W. Magic graph. Birkhäuser, Boston: Springer Science & Business Media; 2001.
- Bača M, Bashir F, Semaničová A. Face antimagic labeling of antiprisms. Util Math. 2011;84:209–224.