Photo from wikipedia
The strong geodetic number, $$\text {sg}(G),$$ sg ( G ) , of a graph G is the smallest number of vertices such that by fixing a suitable geodesic between each… Click to show full abstract
The strong geodetic number, $$\text {sg}(G),$$ 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})$$ sg ( K n , m ) is given, as well as a formula for the crown graphs $$S_n^0$$ S n 0 . Bounds on the strong geodetic number of the hypercube $$Q_n$$ Q n are also discussed.
Keywords:
strong geodetic;
number;
complete bipartite;
number complete;
geodetic number;
crown graphs
Journal Title: Bulletin of the Malaysian Mathematical Sciences Society
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Bulletin of the Malaysian Mathematical Sciences Society
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!