The $k$-distance mutual-visibility problem in graphs
The $k$-distance mutual-visibility problem in graphs
The concept of mutual visibility in graphs, introduced recently, addresses a fundamental problem in Graph Theory concerning the identification of the largest set of vertices in a graph such that any two vertices have a shortest path connecting them, excluding internal vertices of the set. Originally motivated by some challenges …