✦ LIBER ✦

On bandwidth sums of graphs

✍ Scribed by Bing Yao; Jianfang Wang

Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1995
Tongue: English
Weight: 395 KB
Volume: 11
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf02012624

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A study on cyclic bandwidth sum

✍ Ying-Da Chen; Jing-Ho Yan 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 360 KB

On integral sum graphs

✍ Baogen Xu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the bandwidth of a Hamming graph

✍ L.H. Harper 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 198 KB

The bandwidth of the Hamming graph (the product, (Kn) d , of complete graphs) has been an open question for many years. Recently Berger-Wolf and Rheingold [1] pointed out that the bandwidth of a numbering of the Hamming graph may be interpreted as a measure of the e ects of noise in the multi-channe

Graphs omitting sums of complete graphs

✍ Cherlin, Gregory; Shi, Niandong 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 2 views

For every finite m and n there is a finite set {G 1 , . . . , G l } of countable (m • K n )-free graphs such that every countable (m • K n )-free graph occurs as an induced subgraph of one of the graphs G i .

Lattice bandwidth of random graphs

✍ Colin McDiarmid; Zevi Miller 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 430 KB

The bandwidth problem and operations on

The bandwidth problem and operations on graphs

✍ J Chvatalova; J Opatrny 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 479 KB

For a given graph G and vertices u, v in G let ,,,~ ~(.,~) G(-,,o) G~, o) denote the graph Gm ~ Va , ~s :, obtained from G by merging vertices u, v, adding edge (u, v), subdividing edge (u, v), contracting edge (u, v) of G, respectively. We give upper and lower bounds for the bandwidth of ~'~ ~(~'~)