The following pages link to Geodetic sets in graphs (Q4522466):
Displaying 24 items.
- Monophonic numbers of the join and composition of connected graphs (Q870979) (← links)
- On the geodetic number of median graphs (Q941326) (← links)
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs (Q941349) (← links)
- On the geodetic and geodetic domination numbers of a graph (Q982620) (← links)
- On the geodetic number and related metric sets in Cartesian product graphs (Q998436) (← links)
- Total restrained geodetic number of graphs (Q1696108) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
- The restrained geodetic number of a graph (Q2350702) (← links)
- Strong edge geodetic problem in networks (Q2409583) (← links)
- On minimal geodetic domination in graphs (Q2516666) (← links)
- Rebuilding convex sets in graphs (Q2566140) (← links)
- Comment on "Edge Geodetic Covers in Graphs (Q2812611) (← links)
- Geodomination in graphs II (Q3634008) (← links)
- The forcing near geodetic number of a graph (Q4965896) (← links)
- (Q5041866) (← links)
- The near geodetic number of a graph (Q5069962) (← links)
- The upper restrained Steiner number of a graph (Q5216442) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- (Q5228101) (← links)
- Connected geodomination in graphs (Q5473103) (← links)
- The Connected Edge-To-Vertex Geodetic Number of a Graph (Q6053086) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
