Bandwidth of the corona of two graphs (Q932628): Difference between revisions

@@ 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.1016/j.disc.2007.07.071
+Normal rank
@@ Property / OpenAlex ID @@
+W2089651515
@@ Property / OpenAlex ID: W2089651515 / rank @@
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Q3139862
@@ Property / cites work: Q3139862 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3803160
@@ Property / cites work: Q3803160 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Results for Bandwidth Minimization
@@ Property / cites work: Complexity Results for Bandwidth Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Bandwidth of the Cartesian product of two connected graphs
+Normal rank
@@ Property / cites work @@
+A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank