The following pages link to Geodetic Sets in Graphs (Q3064400):
Displaying 29 items.
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- On geodetic sets formed by boundary vertices (Q819808) (← links)
- Geodetic metrizations of graphs (Q1297490) (← links)
- Geodetic spectra of graphs. (Q1427436) (← 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)
- Geodetic convexity and Kneser graphs (Q2698271) (← links)
- (Q3118116) (← links)
- Geodesies in Fuzzy Graphs (Q3439027) (← links)
- Geodetic sets in graphs (Q4522466) (← links)
- (Q4537191) (← links)
- Strong geodetic problem on Cartesian products of graphs (Q4579894) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- (Q5310251) (← links)
- (Q6065396) (← links)
- Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
- COMBINATORIAL APPROACH FOR COUNTING GEODETIC SETS WITH SUBDOMINATING NEIGHBORHOOD SYSTEMS (Q6170275) (← links)
- More on the outer connected geodetic number of a graph (Q6174758) (← links)
