Back to Search
Start Over
Strong Geodetic Number of Complete Bipartite Graphs, Crown Graphs and Hypercubes
- Source :
- Bulletin of the Malaysian Mathematical Sciences Society; May 2020, Vol. 43 Issue: 3 p2757-2767, 11p
- Publication Year :
- 2020
-
Abstract
- The strong geodetic number, sg(G),of a graph Gis 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 sg(Kn,m)is given, as well as a formula for the crown graphs Sn0. Bounds on the strong geodetic number of the hypercube Qnare also discussed.
Details
- Language :
- English
- ISSN :
- 01266705 and 21804206
- Volume :
- 43
- Issue :
- 3
- Database :
- Supplemental Index
- Journal :
- Bulletin of the Malaysian Mathematical Sciences Society
- Publication Type :
- Periodical
- Accession number :
- ejs51173042
- Full Text :
- https://doi.org/10.1007/s40840-019-00833-6