Speaker: 田静博士，浙江科技大学

Inviter: 陈绍示（中国科学院数学与系统科学研究院系统科学研究所）

Title: The mutual-visibility problem in graphs

Language: Chinese

Time & Venue: 2026.05.08 16:30-17:30 思源楼525

Abstract: The mutual-visibility problem in graphs deals with selecting a set of vertices under shortest path constraints. Specifically, the goal is to find a largest set of vertices in a given graph such that no shortest path contains three vertices from this set. In this talk, I will present some results on the total mutual-visibility problem in graphs. Let G be a graph and X a subset of its vertices. Two vertices of G are said to be X-visible if there exists a shortest path between them that contains no other vertices of X. If every pair of vertices of G is pairwise X-visible, then X is called a total mutual-visibility set of G. The size of a largest total mutual-visibility set is the total mutual-visibility number.