Abstract
Bc (G) denotes the cyclic bandwidth of graph G. In this paper, we obtain the maximum cyclic bandwidth of graphs of order p with adding an edge e ∈ E [over(G, -)] as follows:Bc (G + e) = { fenced((2 Bc (G), if Bc (G) ≤ frac(p, 8),; ⌈⌉ fenced(frac(1, 3) fenced(⌊⌋ fenced(frac(p, 2)) + 2 Bc (G))), if Bc (G) > frac(p, 8) .)). We also show that this bound is sharp.
Original language | English |
---|---|
Pages (from-to) | 131-137 |
Number of pages | 7 |
Journal | Discrete Applied Mathematics |
Volume | 156 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 2008 |
User-Defined Keywords
- Bandwidth
- Cyclic bandwidth