Bandwidth reduction in rectangular grids
We show that the bandwidth of a square two-dimensional grid of arbitrary size can be reduced if two (but not less than two) edges are deleted. The two deleted edges may not be chosen arbitrarily, but they may be chosen to share a common endpoint or to be non-adjacent.We also show that the bandwidth...
Gespeichert in:
| Datum: | 2018 |
|---|---|
| Hauptverfasser: | Andreescu, Titu, Stromquist, Water, Sunic, Zoran |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Lugansk National Taras Shevchenko University
2018
|
| Schlagworte: | |
| Online Zugang: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/839 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsÄhnliche Einträge
-
Bandwidth reduction in rectangular grids
von: Andreescu, T., et al.
Veröffentlicht: (2007) -
Endomorphisms of Cayley digraphs of rectangular groups
von: Arworn, Srichan, et al.
Veröffentlicht: (2019) -
The presentation of deterministic and strongly deterministic graphs
von: Senchenko, O. S., et al.
Veröffentlicht: (2024) -
Neighborhood-prime labeling of some product graphs
von: Patel, Sanjaykumar Kantibhai, et al.
Veröffentlicht: (2018) -
On \(k\)-graceful labeling of pendant edge extension of complete bipartite graphs
von: Bhoumik, Soumya, et al.
Veröffentlicht: (2018)