Geodesic transversal problem for join and lexicographic product of graphs (Q2140756): Difference between revisions

@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+The geodetic number of the lexicographic product of graphs
+Normal rank
@@ Property / cites work @@
+\([1,k]\)-domination number of lexicographic products of graphs
+Normal rank
@@ Property / cites work @@
+Q3005852
@@ Property / cites work: Q3005852 / rank @@
+Normal rank
@@ Property / cites work @@
+On the roman domination in the lexicographic product of graphs
+Normal rank
@@ Property / cites work @@
+Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
+Normal rank
@@ Property / cites work @@
+On the strong metric dimension of corona product graphs and join graphs
+Normal rank
@@ Property / cites work @@
+On the strong metric dimension of the strong products of graphs
+Normal rank
@@ Property / cites work @@
+Closed formulae for the strong metric dimension of lexicographic product graphs
+Normal rank
@@ Property / cites work @@
+The geodesic-transversal problem
@@ Property / cites work: The geodesic-transversal problem / rank @@
+Normal rank
@@ Property / cites work @@
+The strong metric dimension of graphs and digraphs
+Normal rank
@@ Property / cites work @@
+On the strong metric dimension of Cartesian and direct products of graphs
+Normal rank
@@ Property / cites work @@
+On Metric Generators of Graphs
@@ Property / cites work: On Metric Generators of Graphs / rank @@
+Normal rank