Cyclic bandwidth with an edge added

W. H. Chan*, Peter C.B. Lam, Wai Chee SHIU

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)131-137
Number of pages7
JournalDiscrete Applied Mathematics
Volume156
Issue number1
DOIs
Publication statusPublished - 1 Jan 2008

Scopus Subject Areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

User-Defined Keywords

  • Bandwidth
  • Cyclic bandwidth

Fingerprint

Dive into the research topics of 'Cyclic bandwidth with an edge added'. Together they form a unique fingerprint.

Cite this