Pages that link to "Item:Q1637098"
From MaRDI portal
The following pages link to Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098):
Displaying 11 items.
- Strong geodetic number of graphs and connectivity (Q1988559) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← 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)
- 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 DOUBLY GEODETIC PROBLEM ON GRAPHS (Q5073975) (← links)
- STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS (Q5075633) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
