Metric Dimension on Path-Related Graphs

Graph theory has a large number of applications in the fields of computer networking, robotics, Loran or sonar models, medical networks, electrical networking, facility location problems, navigation problems etc. It also plays an important role in studying the properties of chemical structures. In the field of telecommunication networks such as CCTV cameras, fiber optics, and cable networking, the metric dimension has a vital role. Metric dimension can help us in minimizing cost, labour, and time in the above discussed networks and in making them more efficient. Resolvability also has applications in tricky games, processing of maps or images, pattern recognitions, and robot navigation. We defined some new graphs and named them s−middle graphs, s-total graphs, symmetrical planar pyramid graph, reflection symmetrical planar pyramid graph, middle tower path graph, and reflection middle tower path graph. In the recent study, metric dimension of these path-related graphs is computed