Prefer a chat interface with context about you and your work?
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
If G is a graph and X ⊆ V (G), then X is a total mutual-visibility set if every pair of vertices x and y of G admits a shortest x, y-path P with V (P ) ∩ X ⊆ {x, y}.The cardinality of a largest total mutual-visibility set of …