Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
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(Kn,m) is given, as well as a formula for the crown graphs Sn0. Bounds on sg(Qn) are also discussed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.