The following pages link to The geodetic number of a graph (Q1310238):
Displaying 45 items.
- The forcing near geodetic number of a graph (Q4965896) (← links)
- Further results on the outer connected geodetic number of a graph (Q4985689) (← links)
- (Q5020316) (← links)
- Graphs with large total geodetic number (Q5020411) (← links)
- 2-EDGE CLOSURE ABSORBING SETS IN A GRAPH (Q5036123) (← links)
- On the outer connected geodetic number of a graph (Q5050633) (← links)
- The Upper and Forcing Connected Outer Connected Geodetic Numbers of a Graph (Q5050691) (← links)
- Weak edge triangle free detour number of a graph (Q5054065) (← links)
- Universal lines in graphs (Q5054715) (← links)
- Upper triangle free detour number of a graph (Q5063268) (← links)
- The near geodetic number of a graph (Q5069962) (← links)
- (Q5070081) (← links)
- STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS (Q5073975) (← links)
- STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS (Q5075633) (← links)
- Restrained geodetic domination of edge subdivision graph (Q5101890) (← links)
- RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH (Q5125240) (← links)
- THE GEODETIC DOMINATION NUMBER FOR THE PRODUCT OF GRAPHS (Q5135799) (← links)
- The total double geodetic number of a graph (Q5142137) (← links)
- On the edge geodetic and edge geodetic domination numbers of a graph (Q5212898) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- Restrained geodetic domination in graphs (Q5859494) (← links)
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs (Q5918409) (← links)
- Hull and geodetic numbers for some classes of oriented graphs (Q5918550) (← links)
- Hull and geodetic numbers for some classes of oriented graphs (Q5918666) (← links)
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs (Q5918774) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- (Q6065396) (← links)
- Monitoring edge-geodetic sets: hardness and graph products (Q6094715) (← links)
- (Q6101492) (← links)
- Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
- The restrained double geodetic number of a graph (Q6132248) (← links)
- CHELO INDEX FOR GRAPHS (Q6149000) (← links)
- THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH (Q6149022) (← links)
- (Q6149322) (← links)
- Tension on an edge in a graph (Q6154653) (← links)
- Partially balanced incomplete block (PBIB)-designs associated with geodetic sets in graphs (Q6174138) (← links)
- More on the outer connected geodetic number of a graph (Q6174758) (← links)
- Distance-based covering problems for graphs of given cyclomatic number (Q6546588) (← links)
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity (Q6547818) (← links)
- Extreme outer connected geodesic graphs (Q6563247) (← links)
- The connected and forcing connected restrained monophonic numbers of a graph (Q6563262) (← links)
- Forcing weak edge triangle free detour number of a graph (Q6613149) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)
- Fault-tolerance in distance-edge-monitoring sets (Q6668144) (← links)
- Induced geodetic sequence of a graph (Q6670756) (← links)
