Eva Zmazek: Strong edge geodetic problem on grids
Povzetek. Let G=(V(G),E(G)) be a simple graph. A set S ⊆ V(G) is a strong edge geodetic set if there exists an assignment of exactly one shortest path between each pair of vertices from S, such that these shortest paths cover all the edges E(G). The cardinality of a smallest strong edge geodetic set is the strong edge geodetic number of G. In this talk, the strong edge geodetic problem is studied on the Cartesian product of two paths.
Povezava do seminarja:
Join Zoom Meeting
Meeting ID: 938 5076 4184