Strong geodetic problem on Cartesian products of graphs
Strong geodetic problem on Cartesian products of graphs
The strong geodetic problem is a recent variation of the geodetic problem. For a graph G , its strong geodetic number sg( G ) is the cardinality of a smallest vertex subset S , such that each vertex of G lies on a fixed shortest path between a pair of …