✦ LIBER ✦

Characterization of graphs with equal bandwidth and cyclic bandwidth

✍ Scribed by Peter C.B. Lam; W.C. Shiu; W.H. Chan

Book ID: 108315591
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 94 KB
Volume: 242
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00379-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cyclic bandwidth sum of graphs

✍ Hao Jianxiu 📂 Article 📅 2001 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 264 KB

Graphs with small bandwidth and cutwidth

✍ F.R.K. Chung; P.D. Seymour 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 442 KB

We give counter-examples to the following conjecture which arose in the study of small bandwidth graphs. "For a graph G, suppose that IV(G')( < 1 + ci . diameter (G') for any connected subgraph G' of G, and that G does not contain any refinement of the complete binary tree of cz levels. Is it true

Edge-Bandwidth of Graphs

✍ Jiang, Tao; Mubayi, Dhruv; Shastri, Aditya; West, Douglas B. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 288 KB

Bandwidth of theta graphs with short pat

Bandwidth of theta graphs with short paths

✍ G.W. Peck; Aditya Shastri 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 628 KB

Peck, G.W. and A. Shastri, Bandwidth of theta graphs with short paths, Discrete Mathematics 103 (1992) 177-187. The bandwidth problem for a graph is that of labelling its vertices with distinct integers so that the maximum difference across an edge is minimized. We here solve this problem for all

Ramsey Theory and Bandwidth of Graphs

✍ Zoltán Füredi; Douglas B. West 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 114 KB

On bandwidth sums of graphs

✍ Bing Yao; Jianfang Wang 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 395 KB