Strong geodetic problem in networksManuel, Paul (Avtor) Klavžar, Sandi (Avtor) Xavier, Antony (Avtor) Arokiaraj, Andrew (Avtor) Thomas, Elizabeth (Avtor) geodetic problemstrong geodetic problemApollonian networksSierpiński graphscomputational complexityIn order to model certain social network problems, the strong geodetic problem and its related invariant, the strong geodetic number, are introduced. The problem is conceptually similar to the classical geodetic problem but seems intrinsically more difficult. The strong geodetic number is compared with the geodetic number and with the isometric path number. It is determined for several families of graphs including Apollonian networks. Applying Sierpiński graphs, an algorithm is developed that returns a minimum path cover of Apollonian networks corresponding to the strong geodetic number. It is also proved that the strong geodetic problem is NP-complete.Technical University Press20202025-03-11 12:07:58Znanstveno delo92014UDK: 519.17COBISS_ID: 18817113DOI: 10.7151/dmgt.2139ISSN pri članku: 1234-3099sl