Disprove of a conjecture on the doubly connected domination subdivision number (Q2169241): Difference between revisions

@@ Property / author @@
-Seyyed Mahmoud Sheikholeslami
@@ Property / author: Seyyed Mahmoud Sheikholeslami / rank @@
-Normal rank
@@ Property / author @@
-Hossein Karami
@@ Property / author: Hossein Karami / rank @@
-Normal rank
@@ Property / author @@
+Seyyed Mahmoud Sheikholeslami
@@ Property / author: Seyyed Mahmoud Sheikholeslami / rank @@
+Normal rank
@@ Property / author @@
+Hossein Karami
@@ Property / author: Hossein Karami / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q113890902
@@ Property / Wikidata QID: Q113890902 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s41980-021-00586-8
+Normal rank
@@ Property / OpenAlex ID @@
+W3168501527
@@ Property / OpenAlex ID: W3168501527 / rank @@
+Normal rank
@@ Property / cites work @@
+Inequalities of Nordhaus-Gaddum type for doubly connected domination number
+Normal rank
@@ Property / cites work @@
+On the doubly connected domination polynomial of a graph
+Normal rank
@@ Property / cites work @@
+On the doubly connected domination number of a graph
+Normal rank
@@ Property / cites work @@
+Bounds on the connected domination number of a graph
+Normal rank
@@ Property / cites work @@
+Connected Domination
@@ Property / cites work: Connected Domination / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-transitive graphs of valency 5, 6 and 7
@@ Property / cites work: Distance-transitive graphs of valency 5, 6 and 7 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5746547
@@ Property / cites work: Q5746547 / rank @@
+Normal rank