Cyclic bandwidth with an edge added

W. H. Chan; Peter C.B. Lam; W. C. Shiu

doi:10.1016/j.dam.2007.09.011

Cyclic bandwidth with an edge added

W. H. Chan^*
, Peter C.B. Lam
, W. C. Shiu

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

4 Citations (Scopus)

Abstract

B_c (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:B_c (G + e) = { fenced((2 B_c (G), if B_c (G) ≤ frac(p, 8),; ⌈⌉ fenced(frac(1, 3) fenced(⌊⌋ fenced(frac(p, 2)) + 2 B_c (G))), if B_c (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	https://doi.org/10.1016/j.dam.2007.09.011
Publication status	Published - 1 Jan 2008

User-Defined Keywords

Bandwidth
Cyclic bandwidth

Access to Document

10.1016/j.dam.2007.09.011

Cite this

@article{80c699834b5c44cd9c4622ef479ea6b0,

title = "Cyclic bandwidth with an edge added",

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.",

keywords = "Bandwidth, Cyclic bandwidth",

author = "Chan, \{W. H.\} and Lam, \{Peter C.B.\} and Shiu, \{W. C.\}",

note = "Funding Information: Partially supported by Faculty Research Grant (FRG/06-07/II-28), Hong Kong Baptist University and CERG (HKBU210207), Research Grant Council, Hong Kong. ",

year = "2008",

month = jan,

day = "1",

doi = "10.1016/j.dam.2007.09.011",

language = "English",

volume = "156",

pages = "131--137",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Cyclic bandwidth with an edge added

AU - Chan, W. H.

AU - Lam, Peter C.B.

AU - Shiu, W. C.

N1 - Funding Information: Partially supported by Faculty Research Grant (FRG/06-07/II-28), Hong Kong Baptist University and CERG (HKBU210207), Research Grant Council, Hong Kong.

PY - 2008/1/1

Y1 - 2008/1/1

N2 - 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.

AB - 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.

KW - Bandwidth

KW - Cyclic bandwidth

UR - https://www.scopus.com/pages/publications/35648979535

U2 - 10.1016/j.dam.2007.09.011

DO - 10.1016/j.dam.2007.09.011

M3 - Journal article

AN - SCOPUS:35648979535

SN - 0166-218X

VL - 156

SP - 131

EP - 137

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1

ER -

Cyclic bandwidth with an edge added

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this