2017/08/08 by Vesna Iršič, Iršič, Vesna
Computer Science · #05C12 #05C70 #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1708.02416
openalex publication_date 2017/08/08 · openalex created_date 2022/10/06 · openalex updated_date 2026/07/28
The strong geodetic problem is a recent variation of the classical geodetic\nproblem. For a graph G, its strong geodetic number rm sg(G) is the\ncardinality of a smallest vertex subset S, such that each vertex of G lies\non one fixed geodesic between a pair of vertices from S. In this paper, some\ngeneral properties of the strong geodesic problem are studied, especially in\nconnection with diameter of a graph. The problem is also solved for balanced\ncomplete bipartite graphs.\n