Geodetic Sets in Graphs
From MaRDI portal
Publication:3064400
DOI10.1007/978-0-8176-4789-6_8zbMath1221.05107OpenAlexW98102466MaRDI QIDQ3064400
Matjaž Kovše, Boštjan Brešar, Aleksandra Tepeh Horvat
Publication date: 21 December 2010
Published in: Structural Analysis of Complex Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-8176-4789-6_8
Distance in graphs (05C12) Graph theory (05C99) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ On the toll number of a graph ⋮ Strong geodetic problem on Cartesian products of graphs ⋮ On the \(P_3\)-hull number of Hamming graphs ⋮ Bounds and algorithms for geodetic hulls ⋮ Computing the hull and interval numbers in the weakly toll convexity ⋮ More on the outer connected geodetic number of a graph ⋮ On the approximation hardness of geodetic set and its variants ⋮ Toll number of the strong product of graphs ⋮ Strong geodetic number of graphs and connectivity ⋮ Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes ⋮ Toll convexity ⋮ Products of geodesic graphs and the geodetic number of products ⋮ Toll number of the Cartesian and the lexicographic product of graphs ⋮ The geodetic number of the lexicographic product of graphs ⋮ Strong geodetic problem in grid-like architectures ⋮ Strong geodetic problem in networks ⋮ Strong geodetic cores and Cartesian product graphs ⋮ Strong geodetic problem on complete multipartite graphs
