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

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.