Strong geodetic cores and Cartesian product graphs

Abstract : The strong geodetic problem on a graph G is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of G are covered. To do this as efficiently as possible, strong geodetic cores and related numbers are introduced. Sharp upper and lower bounds on the strong geodetic core number are proved. Using the strong geodetic core number an earlier upper bound on the strong geodetic number of Cartesian products is improved. It is also proved that sg(G K 2) ≥ sg(G) holds for different families of graphs, a result conjectured to be true in general. Counterexamples are constructed demonstrating that the conjecture does not hold in general.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01756450
Contributor : Valentin Gledel <>
Submitted on : Monday, April 2, 2018 - 11:10:55 AM
Last modification on : Wednesday, November 20, 2019 - 3:18:59 AM

File

sg cores March 30 - submit.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01756450, version 1
  • ARXIV : 1803.11423

Citation

Valentin Gledel, Vesna Iršič, Sandi Klavžar. Strong geodetic cores and Cartesian product graphs. 2018. ⟨hal-01756450⟩

Share

Metrics

Record views

133

Files downloads

170