On the neighbour-integrity of sequential joined graphs (Q4951742): Difference between revisions

@@ Property / author @@
+Pinar Dundar
@@ Property / author: Pinar Dundar / 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.1080/00207160008804921
+Normal rank
@@ Property / OpenAlex ID @@
+W2070974525
@@ Property / OpenAlex ID: W2070974525 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of integrity
@@ Property / cites work: A survey of integrity / rank @@
+Normal rank
@@ Property / cites work @@
+On the honesty of graph complements
@@ Property / cites work: On the honesty of graph complements / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-integrity: A survey
@@ Property / cites work: Edge-integrity: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871072
@@ Property / cites work: Q4871072 / rank @@
+Normal rank
@@ Property / cites work @@
+The worst case complexity of the fredholm equation with periodic free term and noisy information<sup>∗</sup>
+Normal rank
@@ Property / cites work @@
+On the Toughness of a Graph
@@ Property / cites work: On the Toughness of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692391
@@ Property / cites work: Q4692391 / rank @@
+Normal rank