B. TonnyK

Connected Mutual-Visibility in Graphs

A set $S$ of vertices of a graph $G$ is a connected mutual-visibility set if every two vertices of $S$ are joined by a shortest path whose internal vertices lie outside $S$, and the subgraph induced by $S$ is connected. We introduce the connected mutual-visibility number $\mu_c(G)$, defined as the maximum cardinality o...