Strong Geodetic Number of Complete Bipartite Graphs, Crown Graphs and Hypercubes
Sign Up to like & getrecommendations! Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-019-00833-6
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… read more here.
Keywords: strong geodetic; number; complete bipartite; number complete ... See more keywords