References
- Chartrand G, Lesniak L, Zhang P. Graphs & digraphs. London: Chapman & Hall; 2015.
- Foucaud F, Narayanan K, Ramasubramony Sulochana L. Monitoring edge-geodetic sets in graphs. In: Algorithms and Discrete Applied Mathematics: 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023, Proceedings. Cham: Springer International Publishing; 2023.
- Skiena S. Implementing discrete mathematics: combinatorics and graph theory with Mathematica. Addison-Wesley Longman Publishing Co., Inc.; 1991.
- Foucaud F, Kao SS, Klasing R, et al. Monitoring the edges of a graph using distances. Discret Appl Math. 2022;319:424–438. doi: 10.1016/j.dam.2021.07.002
- Ji Z, Klasing R, Li W, et al. Erdös-Gallai-type problems for distance-edge-monitoring numbers. Discret 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. Discret Appl Math. 2024;342:153–167. doi: 10.1016/j.dam.2023.09.012
- Harary F, Melter RA. On the metric dimension of a graph. Ars Combin. 1976;2:191–195.
- Khuller S, Raghavachari B, Rosenfeld A. Landmarks in graphs. Discret Appl Math. 1996;70(3):217–229. doi: 10.1016/0166-218X(95)00106-2
- Manuel PD, Abd-El-Barr MI, Rajasingh I, et al. An efficient representation of Benes networks and its applications. J Discret Algor. 2008;6(1):11–19. doi: 10.1016/j.jda.2006.08.003
- Díaz J, Pottonen O, Serna M, et al. On the complexity of metric dimension. In: Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia, September 10–12, 2012. Proceedings 20. Springer Berlin Heidelberg; 2012.
- Hoffmann S, Wanke E. Metric dimension for Gabriel unit disk graphs is NP-complete. In: Algorithms for Sensor Systems: 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012, Ljubljana, Slovenia, September 13–14, 2012. Revised Selected Papers 8. Springer Berlin Heidelberg; 2013.
- Haslegrave J. Monitoring edge-geodetic sets: hardness and graph products. Discret Appl Math. 2023;340:79–84. doi: 10.1016/j.dam.2023.06.033
- Wang C, Li Y, Zhang S, et al. Matching preclusion number of radix triangular mesh with ddd vertices. J Interconnect Netw. 2018;18:1850010. doi: 10.1142/S021926591850010X
- Vidya G, Rajasingh I. Strong edge-coloring of Sierpiński-like graphs. Int J Pure Appl Math. 2016;109(9):176–185.
- Klavzar S. Coloring Sierpi n´ski graphs and Sierpi n´ski gasket graphs. Taiwan J Math. 2008;12(2):513–522. doi: 10.11650/twjm/1500574171
- Estrada-Moreno A, Rodríguez-Bazan ED, Rodríguez-Velázquez JA. On distances in generalized Sierpiński graphs. Appl Anal Discret Math. 2018;12(1):49–69. doi: 10.2298/AADM160802001E