TY  - GEN 
AU  - Brešar, B.
AU  - González Yero, Ismael
A4  - Matemáticas
PY  - 2024
SN  - 0096-3003
UR  - http://hdl.handle.net/10498/31409
AB  - Given a graph G, a set X of vertices in G satisfying that between every two vertices in X (respectively, in G) there is a shortest path whose internal vertices are not in X is a mutual-visibility (respectively, total mutual-visibility) set in G. The...
LA  - eng
PB  - Elsevier
KW  - Mutual-visibility set
KW  - Mutual-visibility number
KW  - Total mutual-visibility set
KW  - Computational complexity
TI  - Lower (total) mutual-visibility number in graphs
DO  - 10.1016/J.AMC.2023.128411
ER  -