Strong Edge Geodetic Problem on Complete Multipartite Graphs and some Extremal Graphs for the Problem

Sandi Klavžar, Eva Zmazek

A set of vertices $X$ of a graph $G$ is a strong edge geodetic set if to any pair of vertices from $X$ we can assign one (or zero) shortest path between them such that every edge o…