The following pages link to Geodetic Sets in Graphs (Q3064400):
Displayed 19 items.
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098) (← links)
- Toll number of the strong product of graphs (Q1712528) (← links)
- Strong geodetic number of graphs and connectivity (Q1988559) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Toll number of the Cartesian and the lexicographic product of graphs (Q2012538) (← links)
- On the toll number of a graph (Q2172405) (← links)
- On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
- Toll convexity (Q2255809) (← links)
- Products of geodesic graphs and the geodetic number of products (Q2259562) (← links)
- The geodetic number of the lexicographic product of graphs (Q2275393) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- Strong geodetic problem on Cartesian products of graphs (Q4579894) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- Bounds and algorithms for geodetic hulls (Q6102275) (← links)
- Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
- More on the outer connected geodetic number of a graph (Q6174758) (← links)