Abstract
The strong geodetic number, $$\text {sg}(G),$$ of a graph G is the smallest number of vertices such that by fixing a suitable geodesic between each pair of selected vertices, all vertices of the graph are covered. In this paper, the formula for $$\text {sg}(K_{n,m})$$ is given, as well as a formula for the crown graphs $$S_n^0$$. Bounds on the strong geodetic number of the hypercube $$Q_n$$ are also discussed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of the Malaysian Mathematical Sciences Society
Paper Title
Journal
Date
