Strong geodetic problem on Cartesian products of graphs
RAIRO-Oper. Res., 52 1 (2018) 205-216
Published online: 2018-05-30
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the computational complexity of the strong geodetic recognition problem
Carlos V.G.C. Lima, Vinicius F. dos Santos, Joãao H.G. Sousa and Sebastián A. UrrutiaRAIRO - Operations Research 58 (5) 3755 (2024)
https://doi.org/10.1051/ro/2024120
On strong geodeticity in the lexicographic product of graphs
S. Gajavalli and A. Berin GreeniAIMS Mathematics 9 (8) 20367 (2024)
https://doi.org/10.3934/math.2024991
Comparative results between the number of subtrees and Wiener index of graphs
Kexiang Xu, Jie Li and Zuwen LuoRAIRO - Operations Research 56 (4) 2495 (2022)
https://doi.org/10.1051/ro/2022118
Strong Edge Geodetic Problem on Grids
Eva ZmazekBulletin of the Malaysian Mathematical Sciences Society 44 (6) 3705 (2021)
https://doi.org/10.1007/s40840-021-01137-4
2274 030054 (2020)
https://doi.org/10.1063/5.0016819
Strong Geodetic Number of Complete Bipartite Graphs, Crown Graphs and Hypercubes
Valentin Gledel and Vesna IršičBulletin of the Malaysian Mathematical Sciences Society 43 (3) 2757 (2020)
https://doi.org/10.1007/s40840-019-00833-6
Strong geodetic cores and Cartesian product graphs
Valentin Gledel, Vesna Iršič and Sandi KlavžarApplied Mathematics and Computation 363 124609 (2019)
https://doi.org/10.1016/j.amc.2019.124609