The Equidistant Dimension of Corona Product Graphs

Sandor E. Tuñón-Andrés, Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez

A subset $S$ of vertices, in a connected graph $G$, is called a distance-equalizer set if for every pair of distinct vertices outside $S$, there exists a vertex in $S$ equidistant…