Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes

2018/10/09 by Gledel, Valentin, Iršič, Vesna
#05C12 #05C70 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1810.04004

Abstract

The strong geodetic number, sg(G), of a graph G is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices of the graph are covered. In this paper, the study of the strong geodetic number of complete bipartite graphs is continued. The formula for sg(K_n,m) is given, as well as a formula for the crown graphs S_n⁰. Bounds on sg(Q_n) are also discussed.

Related

• Strong geodetic number of complete bipartite graphs and of graphs with\n specified diameter
• Strong geodetic problem on complete multipartite graphs
• Strong geodetic problem on Cartesian products of graphs
• Strong Edge Geodetic Problem on Complete Multipartite Graphs and some Extremal Graphs for the Problem
• Strong geodetic cores and Cartesian product graphs