On secure domination in graphs (Q2348710): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2015.05.006
@@ Property / DOI: 10.1016/j.ipl.2015.05.006 / rank @@
-Normal rank
@@ Property / cites work @@
+Dominating sets for split and bipartite graphs
@@ Property / cites work: Dominating sets for split and bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5709011
@@ Property / cites work: Q5709011 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3413515
@@ Property / cites work: Q3413515 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4812925
@@ Property / cites work: Q4812925 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5461685
@@ Property / cites work: Q5461685 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure domination and secure total domination in graphs
+Normal rank
@@ Property / cites work @@
+Q5503336
@@ Property / cites work: Q5503336 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5461705
@@ Property / cites work: Q5461705 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2015.05.006
@@ Property / DOI: 10.1016/J.IPL.2015.05.006 / rank @@
+Normal rank