# Vesna Iršič: Strong geodetic number of complete bipartite graphs and of graphs with specified diameter

Date: 26. 11. 2017

Source: Discrete mathematics seminar

Source: Discrete mathematics seminar

Torek, 28. 11. 2017, od 10h do 12h, Predavalnica 3.07 , Jadranska 21

**Povzetek.**The strong geodetic problem is a recent variation of the classical 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 one fixed geodesic between a pair of vertices from

*S*. In this talk, geodetic and strong geodetic number will be presented, together with some general properties, especially in connection with diameter of a graph. The solution for balanced complete bipartite graphs will also be presented.