Pages that link to "Item:Q2282484"
From MaRDI portal
The following pages link to Strong geodetic problem in networks (Q2282484):
Displaying 9 items.
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Algorithmic upper bounds for graph geodetic number (Q2103929) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- Strong edge geodetic problem on grids (Q2239003) (← links)
- Geodetic number of powers of cycles (Q2333891) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS (Q5073975) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
