A note on the locating-total domination in graphs (Q2364093): Difference between revisions

@@ Property / cites work @@
+Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
+Normal rank
@@ Property / cites work @@
+On locating and differetiating-total domination in trees
+Normal rank
@@ Property / cites work @@
+Bounds on the locating-total domination number of a tree
+Normal rank
@@ Property / cites work @@
+The bipancycle-connectivity of the hypercube
@@ Property / cites work: The bipancycle-connectivity of the hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Locating and total dominating sets in trees
@@ Property / cites work: Locating and total dominating sets in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Locating-total domination in claw-free cubic graphs
+Normal rank
@@ Property / cites work @@
+Locating-total domination in graphs
@@ Property / cites work: Locating-total domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-tolerant locating-dominating sets
@@ Property / cites work: Fault-tolerant locating-dominating sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4435203
@@ Property / cites work: Q4435203 / rank @@
+Normal rank