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...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | Andreescu, Titu, Stromquist, Water, Sunic, Zoran |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/839 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
Bandwidth reduction in rectangular grids
by: Andreescu, T., et al.
Published: (2007) -
Endomorphisms of Cayley digraphs of rectangular groups
by: Arworn, Srichan, et al.
Published: (2019) -
The presentation of deterministic and strongly deterministic graphs
by: Senchenko, O. S., et al.
Published: (2024) -
Neighborhood-prime labeling of some product graphs
by: Patel, Sanjaykumar Kantibhai, et al.
Published: (2018) -
On \(k\)-graceful labeling of pendant edge extension of complete bipartite graphs
by: Bhoumik, Soumya, et al.
Published: (2018)