# Dhanya Roy: Mutual-visibility and general position in double graphs and in Mycielskians

Date of publication: 9. 10. 2024

Discrete mathematics seminar

Tuesday

15

October

Time:

10:15

Location:

Predavalnica 1.01 (Jadranska 21)

Dhanya Roy (Cochin University of Science and Technology, India)

**Abstract**: The general position problem in graphs is to find the maximum number of vertices that can be selected such that no three vertices in the collection lie on a common shortest path. The mutual-visibility problem in graphs is to find the maximum number of vertices that can be selected such that every pair of vertices in the collection has a shortest path between them with no vertex from the collection as an internal vertex. We take a closer look at these problems in double graphs and in Mycielskians.

**Notice the change of location.**