On bandwidth and cyclic bandwidth of graphs

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

On bandwidth and cyclic bandwidth of graphs

P. C. B. Lam
, W. C. Shiu
, W. H. Chan

Department of Mathematics

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

6 Citations (Scopus)

Abstract

Let B(G) and B_c(G) denote the bandwidth and cyclic bandwidth of graph G, respectively. In this paper, we shall give a sufficient condition for graphs to have equal bandwidth and cyclic bandwidth. This condition is satisfied by trees. Thus all theorems on bandwidth of graphs apply to cyclic bandwidth of graphs satisfying the sufficiency condition, and in particular, to trees. We shall also give a lower bound of B_C(G) in terms of B(G).

Original language	English
Pages (from-to)	147-152
Number of pages	6
Journal	Ars Combinatoria
Volume	47
Publication status	Published - Dec 1997

User-Defined Keywords

Bandwidth
Cycle
Cyclic bandwidth
Tree

Cite this

@article{ac21587c26894811ac64825166f8d7ea,

title = "On bandwidth and cyclic bandwidth of graphs",

abstract = "Let B(G) and Bc(G) denote the bandwidth and cyclic bandwidth of graph G, respectively. In this paper, we shall give a sufficient condition for graphs to have equal bandwidth and cyclic bandwidth. This condition is satisfied by trees. Thus all theorems on bandwidth of graphs apply to cyclic bandwidth of graphs satisfying the sufficiency condition, and in particular, to trees. We shall also give a lower bound of BC(G) in terms of B(G).",

keywords = "Bandwidth, Cycle, Cyclic bandwidth, Tree",

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

note = "Funding information: Partially Supported by FRG, Hong Kong Baptist University",

year = "1997",

month = dec,

language = "English",

volume = "47",

pages = "147--152",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - On bandwidth and cyclic bandwidth of graphs

AU - Lam, P. C. B.

AU - Shiu, W. C.

AU - Chan, W. H.

N1 - Funding information: Partially Supported by FRG, Hong Kong Baptist University

PY - 1997/12

Y1 - 1997/12

N2 - Let B(G) and Bc(G) denote the bandwidth and cyclic bandwidth of graph G, respectively. In this paper, we shall give a sufficient condition for graphs to have equal bandwidth and cyclic bandwidth. This condition is satisfied by trees. Thus all theorems on bandwidth of graphs apply to cyclic bandwidth of graphs satisfying the sufficiency condition, and in particular, to trees. We shall also give a lower bound of BC(G) in terms of B(G).

AB - Let B(G) and Bc(G) denote the bandwidth and cyclic bandwidth of graph G, respectively. In this paper, we shall give a sufficient condition for graphs to have equal bandwidth and cyclic bandwidth. This condition is satisfied by trees. Thus all theorems on bandwidth of graphs apply to cyclic bandwidth of graphs satisfying the sufficiency condition, and in particular, to trees. We shall also give a lower bound of BC(G) in terms of B(G).

KW - Bandwidth

KW - Cycle

KW - Cyclic bandwidth

KW - Tree

UR - https://combinatorialpress.com/ars/arch/vol47/

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

M3 - Journal article

AN - SCOPUS:0039466732

SN - 0381-7032

VL - 47

SP - 147

EP - 152

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

On bandwidth and cyclic bandwidth of graphs

Abstract

User-Defined Keywords

Other files and links

Fingerprint

Cite this