𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bandwidth sums of block graphs and cacti

✍ Scribed by Gerard Jennhwa Chang, Ma-Lian Chia, David Kuo…


Book ID
120694209
Publisher
Springer US
Year
2012
Tongue
English
Weight
393 KB
Volume
27
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On bandwidth sums of graphs
✍ Bing Yao; Jianfang Wang 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 395 KB
Cyclic bandwidth sum of graphs
✍ Hao Jianxiu 📂 Article 📅 2001 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 264 KB
Zero-sum block designs and graph labelin
✍ Zsolt Tuza 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

Proving a conjecture of Aigner and Triesch, we show that every graph G = (V,E) without isolated vertices and isolated edges admits an edge labeling 5: E -{0,1}" with binary vectors of length m = [log2 nl + 1 such that the sums 6 ( v ) := 1 ; ; ; &(e) (taken modulo 2 componentwise) are mutually disti

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 .

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