Voir la notice de l'article provenant de la source Numdam
The strong geodetic problem is a recent variation of the geodetic problem. For a graph , its strong geodetic number sg is the cardinality of a smallest vertex subset , such that each vertex of lies on a fixed shortest path between a pair of vertices from . In this paper, the strong geodetic problem is studied on the Cartesian product of graphs. A general upper bound for sg is determined, as well as exact values for , and prisms over □ K, and prisms over . Connections between the strong geodetic number of a graph and its subgraphs are also discussed.–e. Connections between the strong geodetic number of a graph and its subgraphs are also discussed.
Keywords: Geodetic problem, strong geodetic problem, isometric path problem, Cartesian product, subgraph
Iršič, Vesna 1 ; Klavžar, Sandi 1
@article{RO_2018__52_1_205_0,
author = {Ir\v{s}i\v{c}, Vesna and Klav\v{z}ar, Sandi},
title = {Strong geodetic problem on {Cartesian} products of graphs},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {205--216},
publisher = {EDP-Sciences},
volume = {52},
number = {1},
year = {2018},
doi = {10.1051/ro/2018003},
mrnumber = {3812477},
zbl = {1392.05033},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2018003/}
}
TY - JOUR AU - Iršič, Vesna AU - Klavžar, Sandi TI - Strong geodetic problem on Cartesian products of graphs JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2018 SP - 205 EP - 216 VL - 52 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro/2018003/ DO - 10.1051/ro/2018003 LA - en ID - RO_2018__52_1_205_0 ER -
%0 Journal Article %A Iršič, Vesna %A Klavžar, Sandi %T Strong geodetic problem on Cartesian products of graphs %J RAIRO - Operations Research - Recherche Opérationnelle %D 2018 %P 205-216 %V 52 %N 1 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro/2018003/ %R 10.1051/ro/2018003 %G en %F RO_2018__52_1_205_0
Iršič, Vesna; Klavžar, Sandi. Strong geodetic problem on Cartesian products of graphs. RAIRO - Operations Research - Recherche Opérationnelle, Tome 52 (2018) no. 1, pp. 205-216. doi: 10.1051/ro/2018003
Cité par Sources :
