Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes

Valentin Gledel 1 Vesna Iršič
1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
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(K n,m) is given, as well as a formula for the crown graphs S 0 n. Bounds on sg(Q n) are also discussed.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01892332
Contributor : Valentin Gledel <>
Submitted on : Wednesday, October 10, 2018 - 3:17:22 PM
Last modification on : Wednesday, October 31, 2018 - 12:24:25 PM
Long-term archiving on : Friday, January 11, 2019 - 4:48:39 PM

File

sg_K_mn.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01892332, version 1
  • ARXIV : 1810.04004

Citation

Valentin Gledel, Vesna Iršič. Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes. 2018. ⟨hal-01892332⟩

Share

Metrics

Record views

68

Files downloads

83