Edge Weighting Functions on Dominating Sets (Q4916094): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.21649
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.21649 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1524129729
@@ Property / OpenAlex ID: W1524129729 / rank @@
+Normal rank
@@ Property / cites work @@
+On the upper total domination number of Cartesian products of graphs
+Normal rank
@@ Property / cites work @@
+On the computational complexity of upper total domination
+Normal rank
@@ Property / cites work @@
+Vertex criticality for upper domination and irredundance
+Normal rank
@@ Property / cites work @@
+Upper domination and upper irredundance perfect graphs
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper total domination in claw‐free graphs
@@ Property / cites work: Upper total domination in claw‐free 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 @@
+A semi-induced subgraph characterization of upper domination perfect graphs
+Normal rank