Strong edge geodetic problem on grids (Q2239003): Difference between revisions

@@ Property / DOI @@
-.1007/s40840-021-01137-4
@@ Property / DOI: 10.1007/s40840-021-01137-4 / rank @@
-Normal rank
@@ Property / cites work @@
+Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
+Normal rank
@@ Property / cites work @@
+Strong geodetic cores and Cartesian product graphs
+Normal rank
@@ Property / cites work @@
+The geodetic number of a graph
@@ Property / cites work: The geodetic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
+Normal rank
@@ Property / cites work @@
+Strong geodetic problem on Cartesian products of graphs
+Normal rank
@@ Property / cites work @@
+Strong geodetic problem on complete multipartite graphs
+Normal rank
@@ Property / cites work @@
+Strong geodetic problem in grid-like architectures
+Normal rank
@@ Property / cites work @@
+Strong edge geodetic problem in networks
@@ Property / cites work: Strong edge geodetic problem in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Strong geodetic problem in networks
@@ Property / cites work: Strong geodetic problem in networks / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
+Normal rank
@@ Property / cites work @@
+Edge geodetic number of a graph
@@ Property / cites work: Edge geodetic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Strong geodetic number of graphs and connectivity
@@ Property / cites work: Strong geodetic number of graphs and connectivity / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S40840-021-01137-4
@@ Property / DOI: 10.1007/S40840-021-01137-4 / rank @@
+Normal rank