Pages that link to "Item:Q1988584"

The following pages link to Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584):

Displaying 3 items.

• 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 DOUBLY GEODETIC PROBLEM ON GRAPHS (Q5073975) (← links)