Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products

Dorota Kuziak, Juan A. Rodríguez-Velázquez

Given a connected graph $G$, the total mutual-visibility number of $G$, denoted ${\mu }_t(G)$, is the cardinality of a largest set $S\subseteq V(G)$ such that for every pair of vertices…