Connected Mutual-Visibility in Graphs

Abstract

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 $μ_c(G)$, defined as the maximum cardinality of such a set, and investigate its structural and algorithmic properties. We establish fundamental bounds, derive Nordhaus--Gaddum type inequalities, and characterise the graphs attaining the minimum and maximum possible values. For regular $(d,2,-δ)$-graphs, we derive general bounds on $μ_c(G)$ and determine its exact value for the two cubic graphs of defect $2$. We further show that $μ_c(G)$ is determined locally by the block structure of $G$, namely, it is equal to the maximum of the corresponding values over the blocks of $G$. Finally, we present a polynomial-time algorithm for recognising connected mutual-visibility sets and prove that the associated decision problem is $\mathsf{NP}$-complete, even for connected bipartite graphs of diameter at most $4$.