Monophonic position sets of Cartesian and lexicographic products of graphs

Ullas Chandran S. V., Sandi Klavžar, Neethu P. K. +1

The general position problem in graph theory asks for the number of vertices in a largest set $S$ of vertices of a graph $G$ such that no shortest path of $G$ contains more than tw…